Template Function ADS::quickSort(List<T>&, C)

• Defined in File QuickSort.h

Function Documentation

template<class T, class C = std::less<>>
void ADS::quickSort(List<T> &L, C less = C())

Quicksort of a list with pointers: the items go to three lists, smaller, equal and larger than the first one, the first and the last are sorted and the three are joined.

Post:

L is sorted