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

1 vote122 views1 answer
0009:err:mscoree:CLRRuntimeInfo_GetRuntimeHost Wine Mono is not installed
C++
1 vote133 views2 answers
Auto i cpp
C++
10 votes130 views3 answers
What is pi
C++
3 votes139 views3 answers
C++ colored output
C++
0 vote131 views1 answer
Find maximum contiguous Sub arrays
C++
9 votes138 views2 answers
Delete last char of string C++
C++
3 votes138 views1 answer
C++ get files in directory
C++
3 votes167 views2 answers
C++ first letter of string
C++
0 vote175 views1 answer
How to analyse a poem
C++
1 vote126 views1 answer
Ue4 bind function to button clicked c++
C++