quicksort

English edit

The quicksort algorithm sorting the array {6, 5, 3, 1, 8, 7, 4}.

Etymology edit

Quick +‎ sort, from its computational efficiency.

Pronunciation edit

(General American) enPR: kwĭkʹsôrt', IPA^(key): /ˈkwɪkˌsɔɹt/
Hyphenation: quick‧sort

Noun edit

quicksort (plural quicksorts)

(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 ML:
  Somewhat surprisingly, the average behaviour of quicksort is the same as the best behaviour.

Translations edit

sorting algorithm

Finnish: pikalajittelu, pikajärjestäminen

Verb edit

quicksort (third-person singular simple present quicksorts, present participle quicksorting, simple past and past participle quicksorted)

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