/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

2 votes355 views1 answer
Get elements of tuple c++
C++
0 vote442 views1 answer
Virtual function c++
C++
1 vote324 views1 answer
Cpp float to string
C++
1 vote333 views1 answer
C++ base constructor
C++
0 vote312 views1 answer
C++ tab
C++
0 vote341 views1 answer
Matrix dynamic memory c++
C++
0 vote364 views1 answer
C++ allocate dynamic with initial values
C++
1 vote352 views1 answer
Can you chnage the address of a pointer
C++
1 vote379 views1 answer
Area of a Circle in C++ Programming
C++
0 vote358 views1 answer
Visual studio getline not working
C++