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

22 votes246 views6 answers
Sort array in descending order c++
C++
0 vote283 views1 answer
UENUM ue4
C++
15 votes208 views4 answers
C++ random
C++
0 vote232 views1 answer
String.begin() c++
C++
1 vote198 views1 answer
Eosio check account exist
C++
0 vote201 views1 answer
Ex:Roblox
C++
1 vote190 views1 answer
Operator overloading
C++
17 votes188 views2 answers
Convert string to char c++
C++
0 vote238 views2 answers
Iostream c++
C++
0 vote179 views1 answer
Pascal's triangle in c++ through pointer
C++