Quickselect

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, quickselect is a <a href="/facts/Selection_algorithm/zyxLnxNf">selection algorithm</a> to find the kth smallest element in an unordered list, also known as the kth <a href="/facts/Order_statistics/QS3RnGcC">order statistic</a>. Like the related <a href="/facts/Quicksort/1BeqhLAH">quicksort</a> sorting algorithm, it was developed by <a href="/facts/Tony_Hoare/vBeb3cmn">Tony Hoare</a>, and thus is also known as Hoare's selection algorithm. Like quicksort, it is efficient in practice and has good average-case performance, but has poor worst-case performance. Quickselect and its variants are the selection algorithms most often used in efficient real-world implementations. 
Quickselect uses the same overall approach as quicksort, choosing one element as a pivot and partitioning the data in two based on the pivot, accordingly as less than or greater than the pivot. However, instead of recursing into both sides, as in quicksort, quickselect only recurses into one side – the side with the element it is searching for. This reduces the average complexity from 
 
 
 
 O
 (
 n
 log
 ⁡
 n
 )
 
 
 {\displaystyle O(n\log n)}
 
 to 
 
 
 
 O
 (
 n
 )
 
 
 {\displaystyle O(n)}
 
, with a worst case of 
 
 
 
 O
 (
 
 n
 
 2
 
 
 )
 
 
 {\displaystyle O(n^{2})}
 
.
As with quicksort, quickselect is generally implemented as an <a href="/facts/In-place_algorithm/Ghe2PJUF">in-place algorithm</a>, and beyond selecting the kth element, it also partially sorts the data. See <a href="/facts/Selection_algorithm/zyxLnxNf">selection algorithm</a> for further discussion of the connection with sorting.

Quickselect open-in-new

Quickselect