/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 vote193 views1 answer
Vprintf
C++
0 vote173 views1 answer
C++ check if char is number
C++
0 vote274 views1 answer
C++ generic pointer
C++
0 vote125 views1 answer
Std::vector to array
C++
1 vote170 views1 answer
C++ code for bubble sort
C++
5 votes179 views6 answers
While loop c++
C++
2 votes186 views1 answer
C++ print colorful
C++
0 vote165 views1 answer
Select elements from array C++
C++
0 vote162 views1 answer
How to install boost c++ on windows
C++
0 vote165 views1 answer
How to refresh multiple command lines in C++ stream
C++