/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

3 votes208 views1 answer
C++ check if string contains uppercase
C++
1 vote236 views1 answer
Cmake define standard c++
C++
0 vote229 views1 answer
Pointers mcq sanfoundry
C++
0 vote223 views1 answer
Phi function
C++
1 vote242 views3 answers
Pdf to text python 3
C++
3 votes217 views1 answer
How to convert qt string to string
C++
0 vote272 views3 answers
11
C++
2 votes222 views3 answers
How to find length of character array in c++
C++
0 vote246 views1 answer
C++ lettura file
C++
3 votes238 views5 answers
Combine two vectors c++
C++