/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

7 votes321 views1 answer
Convert binary to decimal c++ stl
C++
-1 vote309 views2 answers
Vector to char array c++
C++
0 vote306 views1 answer
Reverse string upper to lower
C++
0 vote347 views1 answer
How to cehck if list has element c++
C++
31 votes274 views1 answer
When to use struct vs class c++
C++
0 vote335 views1 answer
Know what the input data is whether integer or not
C++
0 vote308 views1 answer
How can I replace a pattern from string in c++
C++
5 votes306 views5 answers
How to convert char to int in c++
C++
0 vote296 views1 answer
Setw in c++
C++
0 vote299 views2 answers
How to compile with libstdc++ fedora
C++