Also found in: Wikipedia.


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 ] ++ [ x ] ++ qsort [ u | u<-xs, u>=x ]

[Mark Jones, Gofer prelude.]
Mentioned in ?
References in periodicals archive ?
Tsigas, "GPU-quicksort: A practical quicksort algorithm for graphics processors", Journal of Experimental Algorithmics, vol.
Note that the Quicksort method is utilized in MFO and the sort's computational complexity is O(n log n) and O([n.
It consists in evaluating the run-times of three well-known sorting algorithms: QuickSort, BubbleSort and InsertSort.
Partial Quicksort [15] sorts the lth smallest ones and provides a nice example with non positive costs rv C.
The top 10 of the Computing in Science & Engineering include the Dantzig simplex method for linear programming in 1947, the Krylov subspace iteration in 1952, the Metropolis Algorithm in 1953, the Fortran I compiler in 1957, the QR algorithm in 1958, the decompositional approach to matrix computation in 1961, a perspective on Quicksort in 1962, the Fast Fourier transform in 1965, the integer relation detection in 1977, and the fast multipole algorithm in 1987.
The topics covered by the course are the following: algorithm complexity analysis, elementary data structures (arrays and lists), abstract data structures (stacks, queues, priority queues, trees), search algorithms (binary search, binary search trees, AVL and 2-3 trees, tries, random search), sorting algorithms (elementary algorithms, quicksort, mergesort, heap sort), graphs (representation, search algorithms, MST).
We have evaluated out solution using The Quicksort method under the MPI platform.
Lastly, Corel QuickSort for Mac or Windows is designed to make it easier for users to reduce the number of digital images they have and isolate the best shots.
Some algorithms, such as those for sorting a list using quicksort, will run very fast.
Then, applying for examples the well-known sorting algorithm Quicksort in order to sort this set of random size we have for the number of comparisions [C.
The algorithm uses quicksort to construct a total ordering of objects where each partition is consistent with the majority of the edges for the pivot node.