/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 vote353 views2 answers
If ERRORLEVEL
C++
2 votes350 views1 answer
How to use python sleep function on c++
C++
1 vote274 views2 answers
To kill
C++
0 vote300 views1 answer
Distructor of the node of the link list
C++
14 votes287 views6 answers
How to get size of array c++
C++
4 votes360 views2 answers
Cpp string find all occurence
C++
0 vote345 views1 answer
Ue4 c++ string from fvector
C++
1 vote302 views1 answer
C++ code for bubble sort
C++
0 vote320 views1 answer
Initialize many variablles c++
C++
2 votes320 views1 answer
C++ lambda thread example
C++