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 vote332 views1 answer
Come concatenare stringhe in c++
C++
-1 vote293 views3 answers
Convert c code to c++
C++
105 votes461 views6 answers
C++ int to string
C++
0 vote313 views1 answer
A variable with 2 independant variables plot
C++
0 vote335 views1 answer
C++ read each char of string
C++
0 vote314 views3 answers
Best gun in freefire for headshot
C++
1 vote349 views1 answer
Shout sharkest
C++
-1 vote344 views1 answer
How to append two vectors in c++
C++
0 vote316 views1 answer
Qt graphics scene map cursor position
C++
1 vote348 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++