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 vote114 views1 answer
Cpp malloc
C++
0 vote120 views1 answer
Call of overloaded ‘swap(int&, int&)’ is ambiguous
C++
0 vote109 views1 answer
C function as paramter
C++
0 vote111 views3 answers
Best gun in freefire for headshot
C++
-1 vote111 views1 answer
Initialize variable in switch case c++
C++
1 vote123 views1 answer
Get a string from file in c++
C++
0 vote109 views2 answers
C++ function for checking if a sting is a number
C++
9 votes106 views4 answers
Max c++
C++
1 vote108 views1 answer
Cpp code for euclids GCD
C++
1 vote159 views1 answer
Default access modifier in c++ in struct
C++