/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 vote130 views1 answer
Check if cin didn't get int
C++
19 votes153 views1 answer
How to output to a file in c++
C++
1 vote132 views1 answer
Getline cin is being skipped
C++
0 vote137 views1 answer
C++ multiply char
C++
0 vote142 views1 answer
C++ program to convert fahrenheit to kelvin
C++
0 vote132 views1 answer
Hash Sort in C++
C++
16 votes123 views3 answers
Count a character in a string c++
C++
3 votes125 views1 answer
What is a variable in cpp
C++
0 vote130 views1 answer
Arraylist equivalent cpp
C++
-1 vote135 views1 answer
Permutation c++
C++