[prolways]

It it ever actually faster than https://en.wikipedia.org/wiki/Smoothsort ?

[aidenn0]

Forget 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.

[cprayingmantis]

I'd say bubble sort is just easier to implement and more widely known.