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 vote323 views1 answer
Error: ‘memset’ was not declared in this scope in cpp
C++
12 votes320 views3 answers
C++ vector size
C++
0 vote334 views1 answer
Call of overloaded ‘swap(int&, int&)’ is ambiguous
C++
1 vote333 views1 answer
Qt double en qstring
C++
0 vote316 views2 answers
Faxc
C++
1 vote323 views3 answers
Right shift in c++
C++
0 vote326 views1 answer
Temperature conversion in c++
C++
2 votes330 views1 answer
Who to include a library c++
C++
0 vote323 views1 answer
Syntax of member function in c++
C++
0 vote393 views1 answer
Vprintf
C++