英文字典中文字典51ZiDian.com

The Free On-line Dictionary of Computing (foldoc)

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 {recursive}ly 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 ]
qsort [ u | u<-xs, u>=x ]

[Mark Jones, Gofer prelude.]

请选择你想看的字典辞典：

单词	字典	翻译
quicksort	查看　quicksort　在百度字典中的解释	百度英翻中〔查看〕
quicksort	查看　quicksort　在Google字典中的解释	Google英翻中〔查看〕
quicksort	查看　quicksort　在Yahoo字典中的解释	Yahoo英翻中〔查看〕