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 vote332 views1 answer
Opencv read gif c++
C++
1 vote259 views1 answer
Collections c# vs c++
C++
0 vote276 views1 answer
Not c++
C++
0 vote249 views1 answer
& before function arg in cpp
C++
0 vote250 views1 answer
Vector stop at newline
C++
19 votes257 views1 answer
Access last element in vector in c++
C++
0 vote239 views1 answer
Define c++
C++
8 votes256 views5 answers
Resize vector c++
C++
4 votes273 views1 answer
Clear file before writing c++
C++
0 vote274 views1 answer
Find largest number in each row in array c++ using function
C++