3 ms·
You do know that the most popular general-purpose, comparison-based sorting algorithm quicksort has a worst case complexity of O(n^2), right?
by throwaway1579 10y ago
You do know that the most popular general-purpose, comparison-based sorting algorithm quicksort has a worst case complexity of O(n^2), right?
- minitech 10y agoGood implementations tend to address this with introspection, randomization, etc..