3 ms·
It's just quick sort with insertion sort for small base cases.
by zhangxp1998 7y ago
It's just quick sort with insertion sort for small base cases.
- abjKT26nO8 7y agoYou forgot about heapsort. It's a combination of three sorting algorithms, not two. However trivial the difference may seem, I'd still prefer to look at a "C introsort vs C++ introsort" benchmark than a "C quicksort vs C++ often quicksort, but not really" benchmark.