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 vote125 views1 answer
Header for INT_MIN
C++
6 votes124 views1 answer
How to initialize array with new in c++
C++
4 votes132 views1 answer
Git branch in my bash prompt
C++
0 vote117 views1 answer
Disallowcopy c++
C++
7 votes167 views1 answer
Venge io
C++
0 vote132 views1 answer
What does catch(...) mean in c++
C++
7 votes119 views1 answer
Appending a vector to a vector in C++
C++
0 vote143 views1 answer
Armstrong number in cpp
C++
0 vote120 views1 answer
C++ read entire file into a variable
C++
5 votes126 views2 answers
Undefined reference to `pthread_create' c++
C++