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 vote189 views1 answer
C++ write to csv file append
C++
0 vote214 views1 answer
Split text c++
C++
0 vote193 views1 answer
TCA9548 I2CScanner Arduino
C++
12 votes190 views2 answers
Comparator in sort c++
C++
13 votes207 views4 answers
How to lock and hide the cursor unity
C++
0 vote181 views1 answer
C++ program to print natural numbers from 1 to 10 in reverse order using while loop
C++
2 votes196 views2 answers
Tolower funciton in cpp
C++
0 vote175 views1 answer
C++ throw index out of bound
C++
5 votes205 views1 answer
How to include everything in c++
C++
0 vote187 views1 answer
Compile notepad++ c++
C++