/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 vote353 views1 answer
Gamemaker studio
C++
0 vote345 views1 answer
Compile c++ MPI Program
C++
0 vote382 views1 answer
C++ initialize size of 3d vector
C++
18 votes364 views3 answers
Sort in descending order c++ stl
C++
25 votes330 views5 answers
Sort vector in descending order c++
C++
1 vote321 views1 answer
Std::stack
C++
8 votes365 views3 answers
Initialize all elements of vector to 0 c++
C++
0 vote350 views1 answer
Irremoteesp8266 example
C++
1 vote320 views1 answer
Print linkedstack cpp
C++
17 votes341 views2 answers
Convert string to char c++
C++