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

5 votes151 views2 answers
Use sleep in c in windows
C++
0 vote148 views2 answers
String to wstring conversion c++
C++
1 vote156 views1 answer
Binary exponentiation modulo m
C++
0 vote184 views1 answer
Unreal engine overlap events c++ code
C++
0 vote150 views1 answer
Ds1307 rtc set time
C++
0 vote158 views1 answer
How to check if vector is ordered c++
C++
0 vote177 views2 answers
. Shell sort in c++
C++
0 vote164 views1 answer
Hola mundo c++
C++
0 vote149 views1 answer
Header for INT_MIN
C++
1 vote204 views1 answer
C++ std::string find and replace
C++