/C++/C++ sorting and keeping track of indexes

C++ sorting and keeping track of indexes

#include <iostream>
#include <vector>
#include <numeric>      // std::iota
#include <algorithm>    // std::sort, std::stable_sort

using namespace std;

template <typename T>
vector<size_t> sort_indexes(const vector<T> &v) {

  // initialize original index locations
  vector<size_t> idx(v.size());
  iota(idx.begin(), idx.end(), 0);

  // sort indexes based on comparing values in v
  // using std::stable_sort instead of std::sort
  // to avoid unnecessary index re-orderings
  // when v contains elements of equal values 
  stable_sort(idx.begin(), idx.end(),
       [&v](size_t i1, size_t i2) {return v[i1] < v[i2];});

  return idx;
}

Source: stackoverflow.com

Similar codes

0 vote130 views1 answer
C++ create a vecto
C++
2 votes131 views2 answers
C++ sum the digits of an integer
C++
2 votes84 views1 answer
Ascii to char c++
C++
267 votes154 views1 answer
Visual studio c++ compiler
C++
1 vote132 views1 answer
Union of two arrays leetcode
C++
0 vote131 views1 answer
C++ program to find gcd of 3 numbers
C++
1 vote139 views1 answer
C++ pass argument to singleton
C++
12 votes132 views3 answers
Declare vector of size n in c++
C++
0 vote138 views1 answer
Labs c++
C++
0 vote145 views1 answer
Unordered_set to vector
C++