/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

6 votes157 views1 answer
C++ replace character in string
C++
0 vote182 views1 answer
Assoc-right antlr
C++
3 votes162 views2 answers
Precision of fixed in c++
C++
5 votes165 views1 answer
Qt debug
C++
0 vote180 views1 answer
All in one c++
C++
7 votes138 views2 answers
Cpp stl
C++
0 vote159 views2 answers
C++ namespace example
C++
1 vote156 views1 answer
Stock a file in a vector cpp
C++
0 vote153 views1 answer
Heredar constructor c++
C++
0 vote150 views1 answer
How can I delete a substring from a string in c++?
C++