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 vote258 views1 answer
C++ add to array
C++
1 vote198 views1 answer
Certificate exe application
C++
0 vote215 views1 answer
How to change the value of a key in hashmp in c++
C++
6 votes216 views1 answer
How to dynamically allocate an array c++
C++
12 votes221 views4 answers
Sort function descending c++
C++
0 vote220 views1 answer
How-to-read-until-eof-from-cin-in-c++
C++
46 votes201 views3 answers
All data types in C++
C++
-1 vote229 views1 answer
How to pass arrays by reference c++
C++
12 votes182 views2 answers
How can I convert a string in char in c++?
C++
1 vote202 views1 answer
Include spaces while reading strings in cpp
C++