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 vote175 views1 answer
Switch cout print with a prameter c++
C++
4 votes257 views4 answers
Pointer
C++
0 vote206 views1 answer
Runtime error(Exit status:153(File size limit exceeded)) c++
C++
0 vote188 views2 answers
C++ string to wstring
C++
0 vote198 views1 answer
Cpp execute command
C++
0 vote208 views1 answer
Copy assignment operator in c++
C++
0 vote215 views1 answer
C++ fibo
C++
0 vote209 views1 answer
C++ vector quick search
C++
0 vote193 views1 answer
Directed graph in cpp
C++
0 vote181 views1 answer
Nearly similar rectangles hackerrank solution
C++