Re:Bubble Sort: An Archaeological Algorithmic Analysis
by lederhosen on Monday August 28, 2017 @02:18PM
(#15118829)
qsort(3) is quite slow because it can not inline the compare function. If you created a 'generic' bubble sort that take a compare function pointer and no LTO optimization (or use an inlined c++ sort), the quick sort algorithm might be faster even on 50 elements.
[ Parent
| on HN ]
Re:Bubble Sort: An Archaeological Algorithmic Analysis
by krylon on Tuesday August 29, 2017 @11:47AM
(#15125074)
I had suspected that might be a factor.
Either way, at 50 elements, if the difference in performance between qsort and bubblesort has significant impact on overall performance, there is probably something very wrong. ;-)