/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 vote284 views1 answer
How to show c++ binary files in sublime text
C++
1 vote285 views3 answers
How to get a random number between two numbers in c++
C++
0 vote315 views1 answer
C++ find index of all occurrences in string
C++
3 votes282 views3 answers
Map in cpp
C++
4 votes310 views3 answers
Number to binary string c++
C++
0 vote314 views1 answer
Code debut C++
C++
0 vote316 views1 answer
Create dynamic variable c++
C++
0 vote258 views2 answers
Cplusplusbtutotrail
C++
0 vote292 views1 answer
How to store array of string with spaces in c++ stl
C++
29 votes267 views6 answers
String to char*
C++