/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 vote269 views1 answer
Sento freddo a un dente
C++
0 vote258 views2 answers
Grocery shopping list c++ chegg
C++
2 votes264 views3 answers
Online ide c++
C++
0 vote263 views1 answer
Arduino falling edge
C++
1 vote250 views3 answers
C++ map loop through key value
C++
7 votes243 views4 answers
C++ hide console
C++
5 votes281 views2 answers
Delete specific row from dynamic 2d array c++
C++
0 vote266 views1 answer
Days in a year c++
C++
1 vote252 views1 answer
Cpp float to string
C++
0 vote255 views1 answer
What is push() c++
C++