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 vote226 views2 answers
C++ namespace example
C++
0 vote237 views1 answer
Unordered_map header file c++
C++
0 vote218 views1 answer
Graph using queue c++
C++
5 votes200 views4 answers
Power in cpp
C++
2 votes242 views1 answer
C++ for competitive programming
C++
0 vote246 views2 answers
Comment savoir si un nombre est premier c++
C++
4 votes228 views1 answer
How to compare lower case character to uppercase cpp
C++
0 vote236 views2 answers
Interface in c++
C++
0 vote245 views1 answer
How to writte comment in c++
C++
1 vote247 views1 answer
Cpp malloc
C++