Argsort c++

#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;
}

//Usage:
for (auto i: sort_indexes(v)) {
  cout << v[i] << endl;
}

Source: stackoverflow.com

Similar codes

3 votes174 views1 answer
Infinite loop c++
C++
0 vote176 views2 answers
C++ convert vector of digits into integer
C++
13 votes154 views5 answers
Max of a vector c++
C++
0 vote222 views1 answer
C++ basic snippet
C++
8 votes157 views2 answers
Check file exist cpp
C++
0 vote155 views1 answer
Iterate const vector
C++
0 vote183 views1 answer
Javidx9 age
C++
12 votes165 views2 answers
Comparator in sort c++
C++
6 votes171 views1 answer
Should i learn c or c++
C++
0 vote166 views1 answer
C++ little endian or big endian
C++