3 ms·
A Ford–Johnson merge-insertion sort would need 28% fewer comparisons on average than the quick sort used here. https://en.wikipedia.org/wiki/Merge-insertion_so
by anderskaseorg 8y ago
A Ford–Johnson merge-insertion sort would need 28% fewer comparisons on average than the quick sort used here.
https://en.wikipedia.org/wiki/Merge-insertion_sort https://en.wikipedia.org/wiki/Merge-insertion_sort