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 vote255 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
0 vote241 views1 answer
C++ throw index out of bound
C++
9 votes238 views5 answers
C++ cin cout
C++
0 vote243 views1 answer
What type is this c++
C++
3 votes258 views1 answer
C++ how to make a negative float positive
C++
0 vote265 views1 answer
Bitwise operator in C++ example programs
C++
0 vote267 views4 answers
C++ sort vector of objects by property
C++
10 votes255 views3 answers
Integer to char c++
C++
0 vote240 views1 answer
Are maps sorted c++
C++
1 vote211 views1 answer
How to fill all of the array in c++
C++