/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 vote223 views1 answer
Passing custom function in sort cpp
C++
0 vote631 views1 answer
Set keybinding for compiling c++ program in neovim
C++
0 vote219 views1 answer
How to write a conclusion statement for an informative essay
C++
1 vote208 views1 answer
Restting a queue stl
C++
0 vote191 views1 answer
Compilling c++ and c by console
C++
15 votes173 views4 answers
2d vector
C++
0 vote203 views1 answer
Convert c code to java online free
C++
3 votes213 views2 answers
Precision of fixed in c++
C++
0 vote191 views1 answer
Get type of variable in c++
C++
29 votes225 views10 answers
Hello world c++
C++