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 vote289 views1 answer
C++ multiply char
C++
1 vote291 views2 answers
C++ code for selection sort
C++
8 votes284 views4 answers
How print fload wiht 3 decimal in c++
C++
1 vote272 views1 answer
Std::string to qstring
C++
1 vote265 views1 answer
C++ keyboard input
C++
0 vote271 views1 answer
Use uint in c++
C++
1 vote259 views1 answer
Non stoichiometric nacl is yellow
C++
0 vote302 views1 answer
Three way comparison operator c++
C++
0 vote248 views1 answer
How to read rotary encoder c++
C++
20 votes276 views1 answer
Flutter convert datetime in day of month
C++