/C++/C++ sorting and keeping track of indexes

C++ sorting and keeping track of indexes

#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;
}

Source: stackoverflow.com

Similar codes

1 vote124 views3 answers
Cout in c++
C++
3 votes126 views1 answer
How i say hello world in c++
C++
0 vote122 views1 answer
C++ suare
C++
0 vote131 views1 answer
Int main ( ) { int i,n; cin>>n; i=n; while(i>=1) { i=i+5; i=i-6; } }
C++
10 votes122 views3 answers
How to find maximum value in c++
C++
1 vote159 views1 answer
How to read a line from the console in c++
C++
0 vote122 views2 answers
Cplusplusbtutotrail
C++
0 vote125 views1 answer
How to add numbers in c++
C++
0 vote121 views1 answer
Dream speedrun music free download mp3
C++
0 vote121 views1 answer
Add partition mysql
C++