QUICKSORT

Quicksort

Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O comparisons to sort n items. In the worst case, it makes O comparisons, though this behavior is rare. Quicksort is often faster in practice than other O algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort is a comparison sort and, in efficient implementations, is not a stable sort. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only O additional space used by the stack during the recursion.

The above text is a snippet from Wikipedia: Quicksort
and as such is available under the Creative Commons Attribution/Share-Alike License.

quicksort

Noun

  1. A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.

Verb

  1. To sort with such an algorithm.


The above text is a snippet from Wiktionary: quicksort
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!