Word:

Quicksort

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:

qsort :: Ord a => [a] -> [a] qsort [] = [] qsort (x:xs) = qsort [ u | u<-xs, u=x ]

[Mark Jones, Gofer prelude.]
Browse
Quickening
Quickens
quicker
quickest
Quickhatch
quickie
Quicklime
Quickly
Quickness
Quicksand
Quickset
Quicksilver
Quicksilver horizon
Quicksilver water
Quicksilvered
Quicksilvering
-- Quicksort --
Quickstep
Quicktime
Quickwork
quicky
Quicpuid acquiritur servo
Quicquid est contra normam recti est injuria
Quicquid in excessu actum est
Quicquid judicis auctoritati subjictur
Quicquid plantatur solo
Quicquid solvitur
Quid
quid pro quo
Quidam
Quiddany
Quiddative
Quiddit
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy