/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

1 vote385 views2 answers
How to pause a c++ program.
C++
1 vote402 views1 answer
Master header file c++
C++
0 vote353 views1 answer
Create matrix cpp
C++
3 votes346 views2 answers
Find maximum sum in array of contiguous subarrays
C++
1 vote324 views1 answer
G++ -wall option meaning
C++
-1 vote325 views1 answer
C++ if else
C++
2 votes314 views1 answer
C++ get filename from path
C++
7 votes357 views3 answers
Read string with spaces in c++
C++
0 vote315 views1 answer
What do I return in int main() function c++
C++
0 vote327 views1 answer
Return the index where maximum element in a vector
C++