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 vote316 views1 answer
Import matrix from excel to matlab
C++
0 vote328 views1 answer
C++ class constructor variable arguments
C++
0 vote309 views1 answer
Bash script add another user
C++
0 vote313 views1 answer
Your age doubled is: xx where x is the users age doubled. (print answer with no decimal places)
C++
7 votes281 views2 answers
Cpp stl
C++
0 vote325 views1 answer
C++ string erase all occurrences
C++
0 vote320 views1 answer
How to find data size in c++
C++
0 vote316 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
0 vote308 views1 answer
How to increase array memory in c++
C++
2 votes312 views2 answers
C++ convert int to cstring
C++