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 vote233 views1 answer
*= c++
C++
14 votes196 views5 answers
Find length of array c++
C++
0 vote184 views1 answer
Str[i] - '0'
C++
12 votes188 views4 answers
Random number cpp
C++
29 votes290 views6 answers
String to char*
C++
0 vote178 views1 answer
Cpp set time
C++
14 votes147 views5 answers
C++ Type Casting
C++
0 vote166 views1 answer
Unreal engine c++ bind action to function with parameter
C++
0 vote250 views1 answer
Reverse Square Root
C++
0 vote189 views1 answer
Recursive factorial of a number
C++