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 vote332 views1 answer
Check if whole string is uppercase
C++
1 vote349 views1 answer
Calculate time difference cpp
C++
2 votes266 views2 answers
File open cpp
C++
0 vote262 views1 answer
Glut keyboard input
C++
1 vote303 views1 answer
Binary exponentiation
C++
0 vote275 views1 answer
String format decimal places c++
C++
4 votes253 views1 answer
Transform string to lowercase c++
C++
0 vote303 views1 answer
Ds1307 rtc set time
C++
2 votes238 views1 answer
Ascii to char c++
C++
0 vote286 views1 answer
Add partition mysql
C++