/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 vote238 views1 answer
C++ sort cout end
C++
0 vote265 views1 answer
Check whether kth bit is 1
C++
0 vote240 views1 answer
C++ convert int to double
C++
0 vote309 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++
0 vote224 views1 answer
Javascript if else exercises
C++
70 votes336 views5 answers
Erase element from vector c++
C++
0 vote266 views1 answer
++ how to write quotation mark in a string
C++
2 votes256 views1 answer
Pbds in c++
C++
0 vote244 views1 answer
Oncomponentbeginoverlap ue4 c++
C++
1 vote236 views1 answer
Vector2 c++
C++