/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 vote209 views1 answer
How to change the type of something in c++
C++
-1 vote211 views1 answer
Attention nlp
C++
90 votes366 views5 answers
Tostring c++
C++
5 votes175 views1 answer
C++ vector iterator
C++
1 vote587 views1 answer
C++ vector structure
C++
0 vote172 views1 answer
Random 1 diem tren man hinh bang dev c
C++
0 vote212 views1 answer
Fill 2-dimensional array with value
C++
0 vote193 views1 answer
Sum of first 100 natural numbers
C++
0 vote218 views1 answer
Stoi() c++
C++
0 vote179 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++