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 vote365 views1 answer
Avrational compare
C++
1 vote346 views1 answer
Make cin cout faster
C++
0 vote346 views1 answer
Prime factorisation of a number in c++
C++
0 vote357 views1 answer
Result += a +b in c++ meaning
C++
4 votes330 views1 answer
Appending a double to a string c++
C++
0 vote413 views1 answer
C++ generic pointer
C++
0 vote372 views1 answer
Uint8_t in c++
C++
0 vote320 views1 answer
Ordine crescente "senza" vettori in c++
C++
0 vote340 views1 answer
C++ if else if
C++
1 vote325 views1 answer
Float in c++
C++