/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 vote94 views1 answer
2927260.eps 2927262.jpg 2927263.ai License free.txt License premium.txt
C++
0 vote98 views1 answer
Fstring from float c++ ue4
C++
0 vote99 views1 answer
Factorial using recursion cpp
C++
3 votes102 views1 answer
Howt o initialize 3d vector in c++
C++
0 vote115 views1 answer
Imports the elements in the array c++
C++
2 votes91 views6 answers
Loop in c++
C++
0 vote94 views1 answer
F && T || !(T) && F
C++
1 vote98 views1 answer
C++ functions inside functions
C++
-1 vote91 views1 answer
Longest increasing subsequence nlogn c++
C++
0 vote105 views1 answer
Replace komma with space C++
C++