Template Function ADS::mergeSortBottomUp

Function Documentation

template<class T, class C = std::less<>> void ADS::mergeSortBottomUp(std::vector<T> &A, C less = C())

the iterative Merge Sort: the runs of length w are merged in pairs, for w = 1 , 2 , 4 , …