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

5 votes155 views1 answer
All library in c++
C++
1 vote167 views1 answer
Declare nullptr c++
C++
0 vote108 views1 answer
Sleep not declared in this scope c++
C++
1 vote191 views1 answer
How to get the player view point location and rotation in ue4 c++
C++
1 vote173 views2 answers
Pain
C++
1 vote169 views1 answer
String hex to int c++
C++
1 vote162 views1 answer
Create n threads cpp
C++
0 vote145 views1 answer
Bit masking tricks
C++
1 vote144 views1 answer
True/false: the ampersand ( &) is used to dereference a pointer variable in c++.
C++
4 votes152 views4 answers
How to get last element of set in c++
C++