Category:Quicksort-based expected linear selection

From LiteratePrograms
Jump to: navigation, search

One of the most straightforward and practical algorithms for determining the nth smallest or largest element of a list is based on quicksort. The algorithm requires expected linear time (that is, requires linear time with high probability) and is largely identical to quicksort except that instead of recurring on both sublists, it only recurs on the one containing the desired element.

C++'s standard nth_element algorithm is almost always based on this algorithm.

hijacker
hijacker
hijacker
hijacker

Pages in category "Quicksort-based expected linear selection"

The following 2 pages are in this category, out of 2 total.