/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

0 vote294 views1 answer
C++ caps lock key
C++
1 vote311 views1 answer
How to declare 1-D array in C/C++
C++
0 vote312 views1 answer
C++ looping through a vector
C++
2 votes339 views5 answers
How to sort a vector
C++
3 votes296 views1 answer
Find in set of pairs using first value cpp
C++
4 votes305 views2 answers
C++ inline if
C++
1 vote336 views1 answer
If not defined c++
C++
0 vote314 views1 answer
Fstream read write mode
C++
3 votes312 views1 answer
Create a dictionary cpp
C++
0 vote296 views1 answer
Finding nth most rare element code in c++
C++