/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 vote131 views1 answer
The iostream is the head er file which contains all the functions of program like cout, cin and etc.
C++
-1 vote134 views1 answer
Cod Cold War no recoil
C++
0 vote150 views1 answer
Error: Microsoft Visual C++ 14.0 or greater is required. Get it with "Microsoft C++ Build Tools":
C++
1 vote150 views1 answer
How to compare two char* in c++
C++
0 vote148 views1 answer
Cpp concatenate methods
C++
0 vote144 views1 answer
C++ void to avoid functions
C++
14 votes104 views5 answers
C++ Type Casting
C++
0 vote156 views1 answer
Cpp pointer to two dimensional array
C++
0 vote137 views1 answer
Stl reverse sort a array
C++
25 votes156 views10 answers
Netflix
C++