/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 vote280 views1 answer
What are various sections of process
C++
0 vote273 views1 answer
Assegnare valori in c++
C++
0 vote262 views1 answer
What algorithm does bitcoin use
C++
1 vote260 views1 answer
C++ initialize array 1 to n
C++
5 votes278 views1 answer
C++ vector iterator
C++
0 vote282 views4 answers
How to make a square root function in c++ without stl
C++
0 vote255 views1 answer
Spicoli
C++
8 votes299 views1 answer
Remove last letter in string c++
C++
0 vote224 views1 answer
Scss variable is not defined
C++
0 vote283 views1 answer
Operators on strings c++
C++