Quicksort

Quicksort

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.

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.