33 ms·
Merge sort may use an optimal number of comparisons, but that doesn't stop it from being slower than quicksort in most cases in real life.
by jemfinch 16y ago
Merge sort may use an optimal number of comparisons, but that doesn't stop it from being slower than quicksort in most cases in real life.