2
User
Recs.
Recs.
1
Updates
Last
Updated
Updated
Activity
Quicksort is a sorting algorithm that, on average, makes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare. Quicksort is often faster in practice than other O(n log n) algorithms. It was developed in 1960 by Tony Hoare.
Specs
Pros
Know any positive aspects of this option?
Cons
Know any negative aspects of this option?