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 vote221 views1 answer
C++ poitner
C++
0 vote206 views2 answers
C++ namespace example
C++
0 vote207 views1 answer
C++ classes
C++
0 vote250 views1 answer
C++ program to convert fahrenheit to celsius
C++
0 vote198 views1 answer
Could not find the task c c++ active file
C++
0 vote228 views1 answer
Getline of file C++
C++
0 vote269 views1 answer
Youtube Video Downloder Website
C++
1 vote210 views1 answer
Find largest number in vector c++
C++
99 votes273 views6 answers
How to convert int to string c++
C++
0 vote206 views2 answers
Total sales in array c++ two dimensional array
C++