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 vote320 views1 answer
. Single-line comments start with two forward slashes (//).
C++
0 vote334 views1 answer
Currency Converter c++
C++
0 vote384 views1 answer
Gettimeofday header file
C++
1 vote335 views1 answer
Creator of C++
C++
1 vote426 views1 answer
How to hide the c++ console
C++
1 vote295 views1 answer
How to fill all of the array in c++
C++
0 vote354 views1 answer
Inbuilt function for bin to dec in c++
C++
8 votes361 views10 answers
Print
C++
6 votes282 views1 answer
Rng cpp
C++
1 vote335 views1 answer
G++ -wall option meaning
C++