Quicksort From Wikipedia, the free encyclopedia.
Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare that, on average, makes Θ(n log n) comparisons to sort n items. However, in the worst-case, it makes Θ(n2) comparisons. Typically, quicksort is significantly faster in practice than other O(n log n) algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data it is possible to make design choices which minimize the possibility of requiring quadratic time.
- Quicksort or Samplesort Algorithm
- An elegant improvement of Quicksort
- Quicksort algorithms with an early exit for sorted subfiles
- Data Structures and Algorithms: Quicksort