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 vote133 views1 answer
Convert c program to c ++ online
C++
0 vote126 views5 answers
Online c++ graphics compiler
C++
-1 vote155 views1 answer
Multi initialisation if statement c++
C++
6 votes127 views1 answer
To_string c++
C++
0 vote124 views1 answer
How to turn an integer variable into a char c++
C++
0 vote131 views1 answer
Arduino jumper programmieren
C++
0 vote128 views1 answer
Age in days in c++
C++
0 vote129 views1 answer
Log base 10 c+_+
C++
0 vote123 views1 answer
Get type of variable in c++
C++
0 vote134 views1 answer
Hz
C++