/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 vote318 views1 answer
Overloading IO Stream
C++
5 votes312 views1 answer
C++ is string a number
C++
2 votes299 views1 answer
Hwo to calculate the number of digits using log in c++
C++
0 vote306 views1 answer
C++ find minimum value in vector
C++
0 vote290 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
0 vote276 views1 answer
Srand() c++
C++
1 vote268 views1 answer
What are specialized classes c++
C++
0 vote262 views1 answer
Write C++ program that will ask to choose from three cases.
C++
0 vote309 views2 answers
Why magnetron should be placed inside solenoid
C++
0 vote301 views1 answer
C++ schleife abbrechen
C++