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 vote117 views1 answer
What is c++ used for
C++
0 vote117 views1 answer
Wap in c++ to understand function template
C++
0 vote117 views1 answer
Skip headers while reading text
C++
12 votes120 views3 answers
How to get input in cpp
C++
4 votes118 views2 answers
Extended euclidean algorithm
C++
20 votes150 views3 answers
How to append to a vector c++
C++
1 vote102 views1 answer
C++ check if string contains non alphanumeric
C++
0 vote111 views1 answer
Platform io change baud rate
C++
1 vote118 views1 answer
Cpp goiver all the map values
C++
0 vote116 views1 answer
C++ get index of map element
C++