/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 vote304 views1 answer
Flake8 max line length
C++
17 votes318 views2 answers
Convert string to char c++
C++
1 vote332 views2 answers
Torch cuda is available
C++
0 vote358 views1 answer
Sfml time set
C++
0 vote317 views1 answer
Inline in class in C++
C++
1 vote305 views1 answer
Summary a long walk to water
C++
1 vote339 views1 answer
C++ split long code
C++
3 votes308 views2 answers
Maximum int c++
C++
1 vote330 views1 answer
Check if intent has extras
C++
0 vote320 views1 answer
How to turn an integer variable into a char c++
C++