Comment on Sorting Algorithm Cheat SheetparentComments−civility7yAlso no mention of introsort (C++ std::sort), where it uses insertion sort for small arrays, detects if it's fallen too far towards O(n^2) of quicksort, and punts to heapsort when it needs to.−hinkley7yYou can pry my stable sort algorithms out of my cold, dead hands.−civility7yHeh, I think stable sorts are great. However, you don't always need one, and you do pay a little bit for it.−jfoutz7yAdd the factors to the sort key? Every sort is stable if you have some vague ideas about what to sort on.−hinkley7yWhat?
Comments
Also no mention of introsort (C++ std::sort), where it uses insertion sort for small arrays, detects if it's fallen too far towards O(n^2) of quicksort, and punts to heapsort when it needs to.
You can pry my stable sort algorithms out of my cold, dead hands.
Heh, I think stable sorts are great. However, you don't always need one, and you do pay a little bit for it.
Add the factors to the sort key? Every sort is stable if you have some vague ideas about what to sort on.
What?