/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 vote150 views1 answer
How to declare an enum variable c++
C++
0 vote129 views1 answer
. Single-line comments start with two forward slashes (//).
C++
-1 vote117 views1 answer
C++ string to vector int
C++
2 votes129 views2 answers
Stack algorithm in c++
C++
2 votes145 views1 answer
C++ check first character of string
C++
-1 vote126 views1 answer
Delete file c
C++
0 vote130 views1 answer
C++ exam
C++
0 vote129 views1 answer
Fstream read write mode
C++
0 vote119 views1 answer
What algorithm does bitcoin use
C++
0 vote142 views1 answer
"++i + ++i" explanation
C++