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

2 votes333 views1 answer
Runtime Error: Runtime ErrorBad memory access (SIGBUS)
C++
0 vote303 views1 answer
System("pause") note working c++
C++
0 vote318 views1 answer
Platform io change baud rate
C++
1 vote317 views2 answers
How to find the size of a character array in c++
C++
0 vote322 views1 answer
Floor and ceil in cpp
C++
0 vote309 views1 answer
3 conditions for a while loop c++
C++
0 vote300 views1 answer
Remove something from stringstream
C++
0 vote317 views1 answer
GlUniform bool
C++
0 vote324 views1 answer
9+20
C++
15 votes307 views4 answers
How to make a random number in c++
C++