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

21 votes130 views6 answers
Random in c++
C++
-1 vote136 views1 answer
C++ set console title
C++
10 votes81 views3 answers
Namespaces in c++
C++
12 votes130 views3 answers
Max element in array c++ stl
C++
0 vote134 views1 answer
C++ chrono get milliseconds
C++
0 vote132 views1 answer
Count spaces in string java
C++
1 vote127 views1 answer
Argument for c11 in c++
C++
0 vote141 views2 answers
Vector übergeben c++
C++
2 votes142 views1 answer
How to make for loop in c++
C++
8 votes127 views2 answers
‘setprecision’ was not declared in this scope
C++