quicksort

From Wiktionary, the free dictionary
Archived revision by WingerBot (talk | contribs) as of 22:54, 5 October 2019.
Jump to navigation Jump to search

English

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

Etymology

Quick +‎ sort, from its computational efficiency.

Pronunciation

  • Lua error in Module:parameters at line 290: Parameter 1 should be a valid language or etymology language code; the value "GA" is not valid. See WT:LOL and WT:LOL/E. enPR: kwĭkʹsôrt', IPA(key): /ˈkwɪkˌsɔɹt/
  • Hyphenation: quick‧sort

Noun

quicksort (plural quicksorts)

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

Verb

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

  1. (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.