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 vote103 views1 answer
C++ exam
C++
1 vote117 views1 answer
Loop through char in string c++
C++
0 vote94 views1 answer
Swap of two numbers in c++
C++
8 votes103 views3 answers
Initialize all elements of vector to 0 c++
C++
0 vote96 views1 answer
Read large files part by part in C++
C++
6 votes101 views3 answers
Print float up to 3 decimal places in c++
C++
0 vote104 views2 answers
C++ program to find prime number using function
C++
3 votes117 views2 answers
Last element of a set in c++
C++
0 vote103 views1 answer
Wgat is duble in c++
C++
7 votes147 views1 answer
Venge io
C++