/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 vote172 views1 answer
OPA in expanse
C++
0 vote153 views1 answer
Destin'y child
C++
0 vote197 views1 answer
Check if cin got the wrong type
C++
6 votes151 views6 answers
Ue4 log
C++
0 vote163 views1 answer
Fname from FString
C++
0 vote168 views1 answer
Sfml get position
C++
3 votes167 views3 answers
Map in cpp
C++
0 vote176 views1 answer
Template member functions in cpp files
C++
0 vote202 views10 answers
Loop
C++
0 vote172 views1 answer
How to install opencv c++ on windows vscode
C++