Definition: Given an array A of n elements and a positive integer k ≤ n, find the kth smallest element of A and partition the array such that A, ..., A[k-1] ≤ A[k] ≤ A[k+1], ..., A[n].
See also select kth element, Select, MODIFIND, Find.
Note: Algorithms to solve this problem are often used in sort algorithms or to find the median of a set. These can be easily changed to find the kth largest element.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 March 2015.
HTML page formatted Fri Feb 23 10:06:08 2018.
Cite this as:
Vladimir Zabrodsky, "select and partition", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 March 2015. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/selectAndPartition.html