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 vote146 views1 answer
1ll
C++
0 vote200 views1 answer
Quicksort taking random pivot
C++
3 votes184 views1 answer
Initialzing a 2d vector in cpp
C++
22 votes209 views4 answers
Cpp get last element of vector
C++
1 vote195 views1 answer
Uri online judge 3145 solution in c++
C++
-1 vote190 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
2 votes183 views1 answer
How to use string variable in switch case in c++
C++
6 votes191 views3 answers
Sstream c++
C++
1 vote187 views2 answers
Bool to string arduino
C++
0 vote177 views1 answer
Push_back a pair c++
C++