quicksort

Q q

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of quicksort word

noun Technical meaning of quicksort A sorting algorithm with O(n log n) average time complexity. One element, x of the list to be sorted is chosen and the other elements are split into those elements less than x and those greater than or equal to x. These two lists are then sorted recursively using the same algorithm until there is only one element in each list, at which point the sublists are recursively recombined in order yielding the sorted list. This can be written in Haskell: 1
noun quicksort (computing) A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets. 0
verb quicksort (Transitive Verb) (computing) To sort with such an algorithm. 0

See all 3 definitions of quicksort

Information block about the term

Parts of speech for Quicksort

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Quicksort

See also

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?