3 ms·

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 pun

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.

hinkley 7y ago
You can pry my stable sort algorithms out of my cold, dead hands.
- civility 7y ago
  Heh, I think stable sorts are great. However, you don't always need one, and you do pay a little bit for it.
- jfoutz 7y ago
  Add the factors to the sort key? Every sort is stable if you have some vague ideas about what to sort on.
  - hinkley 7y ago
    What?