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

15 votes223 views4 answers
C++ random
C++
1 vote221 views2 answers
C++ Split String By Space into Vector
C++
16 votes247 views3 answers
Console clear c+
C++
40 votes253 views6 answers
Hello world in cpp
C++
0 vote227 views1 answer
Find the max element along with it's index in c++
C++
1 vote210 views3 answers
Print 2d array c++
C++
0 vote216 views1 answer
C++ check if vector is sorted
C++
1 vote213 views3 answers
How to use cout function in c++
C++
12 votes222 views3 answers
How to get input in cpp
C++
0 vote201 views1 answer
Classes and Objects hackerrank in cpp
C++