Re:Why is quicksort better than other sorting algorithms in ...
by aidenn0 on Monday January 20, 2020 @10:59AM
(#22099705)
And if 1.5x the input fits into memory than merge sort is also better because depending on the input, it ranges from "not slower" to "faster".
This puts quicksort in the position where it's only better than merge-sort if the input is larger than 2/3 the available memory, but smaller than the total available memory. IIRC, glibc's quicksort will do a mergesort if it can do so without increasing the heap size.
This puts quicksort in the position where it's only better than merge-sort if the input is larger than 2/3 the available memory, but smaller than the total available memory. IIRC, glibc's quicksort will do a mergesort if it can do so without increasing the heap size.