/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

11 votes259 views5 answers
How to sort array in c++
C++
0 vote268 views2 answers
C++ server service ros
C++
21 votes272 views3 answers
C++ last element of vector
C++
0 vote281 views2 answers
Why magnetron should be placed inside solenoid
C++
0 vote293 views1 answer
How to print a word in c++
C++
0 vote270 views1 answer
Replace komma with space C++
C++
2 votes249 views1 answer
C++ get filename from path
C++
1 vote262 views1 answer
C++ nested switch statements
C++
1 vote243 views1 answer
C++ hide cursor
C++
0 vote269 views1 answer
Adding variables c++
C++