Template Function ADS::mergeSort(std::vector<T>&, std::size_t, C)

• Defined in File MergeSort.h

Function Documentation

template<class T, class C = std::less<>>
void ADS::mergeSort(std::vector<T> &A, std::size_t cutoff = 1, C less = C())

MergeSort(): A in increasing order, stable; parts of at most cutoff items by insertionSort() (1 is the book)

Post:

A is sorted, with the same items