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

-1 vote183 views2 answers
How to delete a file in cpp
C++
0 vote166 views1 answer
C++ drop last element of list
C++
1 vote166 views1 answer
How to do sets in cpp
C++
0 vote197 views1 answer
Assert warning c++
C++
12 votes182 views4 answers
Sort function descending c++
C++
0 vote166 views1 answer
C++ erase last element of set
C++
0 vote193 views1 answer
Heroatx77
C++
10 votes124 views3 answers
Namespaces in c++
C++
0 vote184 views1 answer
C++c
C++
0 vote173 views1 answer
Inline in class in C++
C++