throwaway1579

3 ms·

1. 1.▲
   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?
2. 2.▲
   by throwaway1579 10y ago

   Can't wait for the entry on quicksort.
3. 3.▲
   by throwaway1579 10y ago

   O(n^2) is not the same as O(2^n)