/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 vote230 views1 answer
Create file c++
C++
3 votes213 views1 answer
How i say hello world in c++
C++
0 vote201 views1 answer
C++ execution time
C++
0 vote269 views1 answer
BMI Calculator Program in C++
C++
6 votes225 views2 answers
Create dynamic array c++
C++
0 vote219 views1 answer
Error: ‘CV_WINDOW_AUTOSIZE’ was not declared in this scope
C++
0 vote200 views1 answer
Get future from promise c++
C++
15 votes203 views4 answers
2d vector
C++
-1 vote224 views5 answers
Memset in c++
C++
8 votes219 views5 answers
C++ vector resize
C++