4 ms·
It it ever actually faster than https://en.wikipedia.org/wiki/Smoothsort https://en.wikipedia.org/wiki/Smoothsort ?
by prolways 11y ago
It it ever actually faster than https://en.wikipedia.org/wiki/Smoothsort https://en.wikipedia.org/wiki/Smoothsort
?
- cprayingmantis 11y agoI'd say bubble sort is just easier to implement and more widely known.
- aidenn0 11y agoForget smoothsort, it loses out to insertion sort even. Divide-and-conquer n*lg n algorithms tend to switch to insertion sort when the size of the partition goes below a certain value because of how fast insertion sort is.