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 vote109 views1 answer
How to create a min priority queue of pair of int, int
C++
0 vote124 views1 answer
Shell-Sort C++
C++
3 votes126 views1 answer
Initialize dynamic array c++ to 0
C++
-1 vote120 views2 answers
Balanced parentheses
C++
-2 votes128 views2 answers
Constants in cpp
C++
0 vote117 views1 answer
C++ fstream create if not exists
C++
-1 vote125 views1 answer
C++ set console title
C++
0 vote119 views1 answer
Return the index where maximum element in a vector
C++
15 votes137 views3 answers
C++ string to char array
C++
0 vote137 views1 answer
Qt widget list set selected
C++