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

6 votes323 views2 answers
Find permutations
C++
0 vote257 views3 answers
C++ Dynamic allocation failing
C++
0 vote320 views1 answer
C++ first index 0 or 1
C++
0 vote303 views1 answer
C++ pointer to vector
C++
-1 vote304 views1 answer
C++ how to return an empty vector
C++
0 vote278 views1 answer
Semi colon in argument list c++
C++
0 vote264 views1 answer
How to get characters through their ascii value in c++
C++
5 votes269 views6 answers
While loop c++
C++
2 votes278 views1 answer
Clear buffer memory in c / c++
C++
0 vote282 views1 answer
Shrek c++
C++