/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

1 vote283 views1 answer
C++ std::string find and replace
C++
0 vote182 views1 answer
Cpp cout more than 1 value
C++
18 votes181 views5 answers
C++ random number
C++
7 votes215 views3 answers
Setprecision in c++
C++
3 votes183 views2 answers
Console colors in C++
C++
3 votes193 views1 answer
Set precision with fixed c++
C++
1 vote215 views1 answer
C++ print byte as bit
C++
1 vote193 views3 answers
Cout in c++
C++
0 vote190 views1 answer
Convert char to C
C++
0 vote190 views1 answer
Swap of two numbers in c++
C++