/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

4 votes119 views1 answer
How to check if a value is inside an array in c++
C++
1 vote153 views1 answer
Kwakiutl tribe artifacts
C++
0 vote108 views1 answer
Public method
C++
1 vote103 views1 answer
Ue4 bind function to button clicked c++
C++
0 vote116 views1 answer
Argument to number C++
C++
14 votes123 views5 answers
Length of array c++
C++
0 vote104 views2 answers
Interface in c++
C++
0 vote131 views2 answers
Stoi function in c++ library
C++
0 vote124 views1 answer
How many months have 31 days
C++
0 vote125 views1 answer
Pointeur cpp
C++