Template Function ADS::quickSortTuned

• Defined in File QuickSort.h

Function Documentation

template<class T, class C = std::less<>>
void ADS::quickSortTuned(std::vector<T> &A, std::size_t cutoff = 16, C less = C(), std::size_t *depth = nullptr)

Quicksort with the improvements of section 12.2; the largest number of parts on the stack goes to depth, if given.

Post:

A is sorted, with the same items