Function ADS::fordJohnsonBound

Defined in File KnuthSorts.h

Function Documentation

inline long ADS::fordJohnsonBound(std::size_t n): the worst case of the comparisons of mergeInsertionSort() on n items, sum of ceil( log2( 3 k / 4 ) ) for k = 1 , … , n