/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 vote121 views1 answer
Glut keyboard input
C++
0 vote140 views1 answer
How to read qlistwidget in c++
C++
1 vote148 views1 answer
C++ concurrency
C++
0 vote174 views1 answer
Std distance
C++
3 votes138 views2 answers
C++ check if string contains substring
C++
0 vote147 views1 answer
Person parametr cpp
C++
1 vote136 views1 answer
Controlling in windows
C++
0 vote156 views1 answer
Sfml get position
C++
0 vote164 views1 answer
C++ sudoku solver
C++
0 vote148 views1 answer
Is obje file binary??
C++