Re:Bubble sort is the fastest sorting algorithm
by aidenn0 on Wednesday December 23, 2015 @04:54AM
(#10782688)
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.