Quicksort

Origin

quick + sort, from its computational efficiency.

Full definition of quicksort

Noun

1. (computing) A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.
• 1987, Ã…ke Wikström, Functional Programming Using Standard MLSomewhat surprisingly, the average behaviour of quicksort is the same as the best behaviour.

Verb

1. (transitive, computing) To sort with such an algorithm.
• 1991, Maguire et al, Geographical Information Systems: Principles and ApplicationsThe first and last subsets are then recursively quicksorted.