/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

30 votes138 views10 answers
Google translate
C++
1 vote138 views3 answers
C++ map loop through key value
C++
0 vote134 views1 answer
Sento freddo a un dente
C++
-1 vote140 views1 answer
Socket programming in cpp
C++
0 vote142 views1 answer
Get the absolute path of a boost filePath as a string
C++
-1 vote138 views1 answer
C++ filesystem remove file
C++
0 vote176 views1 answer
Print reverse number
C++
0 vote151 views1 answer
C++ Calculating the Mode of a Sorted Array
C++
7 votes136 views2 answers
Round function in c++
C++
4 votes165 views3 answers
Number to binary string c++
C++