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 vote290 views1 answer
How to store pair in min heap in c++
C++
6 votes311 views1 answer
How to dynamically allocate an array c++
C++
0 vote378 views1 answer
MPI wait
C++
8 votes300 views6 answers
C++ while loop
C++
0 vote306 views1 answer
How to use qdebug c++
C++
20 votes256 views10 answers
Prime number c++
C++
2 votes314 views2 answers
Back() in c++
C++
0 vote282 views1 answer
Void linux java
C++
0 vote326 views1 answer
Namespace file linking c++
C++
1 vote300 views1 answer
Unique ptr c++
C++