Quicksort

A sorting algorithm with O(n log n) average timecomplexity.

One element, x of the list to be sorted is chosen and theother elements are split into those elements less than x andthose greater than or equal to x. These two lists are thensorted recursively using the same algorithm until there isonly one element in each list, at which point the sublists arerecursively 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=x ]

[Mark Jones, Gofer prelude.]

单词	quicksort
释义	Quicksort Quicksort A sorting algorithm with O(n log n) average timecomplexity. One element, x of the list to be sorted is chosen and theother elements are split into those elements less than x andthose greater than or equal to x. These two lists are thensorted recursively using the same algorithm until there isonly one element in each list, at which point the sublists arerecursively 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=x ] [Mark Jones, Gofer prelude.]
随便看	output coupler output data output data acknowledge output data line output data rate output data redundancy output data request output data set output delivery system output device output device emulation protection output devices output distribution network output driver select output (economics) output edge control output efficiency at 20 minutes output enable output enable time output energized output euclidean distance enumerator output exposure rate output feedback output feedback mode output field separator