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 vote190 views1 answer
C++ declare binary number
C++
0 vote238 views1 answer
Convert fahrenheit to celsius
C++
0 vote178 views1 answer
Sinh nhi phan c++
C++
0 vote174 views3 answers
Onoverlapbegin ue4 c++
C++
0 vote284 views1 answer
How to set a variable to infinity in c++
C++
-1 vote249 views1 answer
You don't have an extension for debugging yaml flutter
C++
0 vote206 views1 answer
What is require to run min max function on linux in cpp
C++
1 vote203 views3 answers
Right shift in c++
C++
1 vote177 views2 answers
Length of number c++
C++
1 vote186 views1 answer
Traverse through a string cpp
C++