/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 vote172 views1 answer
Remove item from layout
C++
1 vote167 views1 answer
Elixir update map
C++
0 vote164 views1 answer
Request for member ‘push_back’ in ‘matrix’, which is of non-class type ‘std::vector<int>()’
C++
2 votes148 views1 answer
Find character in string c++
C++
7 votes136 views1 answer
How to make string get spaces c++
C++
9 votes148 views5 answers
C++ cin cout
C++
0 vote140 views1 answer
Gfgdf
C++
0 vote147 views1 answer
Cstring to string
C++
0 vote158 views1 answer
Matrix dynamic memory c++
C++
0 vote163 views1 answer
Ue4 int to enum c++
C++