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

0 vote153 views1 answer
Split a number and store it in vector
C++
1 vote144 views1 answer
C++ sqlite open file in other directory
C++
8 votes139 views6 answers
Char to int in c++
C++
29 votes140 views6 answers
String to int in c++
C++
0 vote184 views1 answer
How to traverse through vector pair
C++
0 vote96 views1 answer
Libraries required for gaming in c++
C++
6 votes146 views2 answers
Precision c++
C++
1 vote149 views1 answer
C++ split long code
C++
1 vote145 views4 answers
Sum vector c++
C++
0 vote151 views1 answer
C++ map values range
C++