Template Function ADS::pigeonholeSort

• Defined in File PigeonholeSort.h

Function Documentation

template<class V>
std::vector<std::pair<int, V>> ADS::pigeonholeSort(const std::vector<std::pair<int, V>> &A, int k)

the pairs sorted by key, the values of a key in their first order

Pre:

k >= 0 and each key of A is in [ 0 , k )

Post:

as many pairs as in A, the keys sorted and each key with its items in their order