Overview
A selection algorithm, also called order statistics, finds the kth smallest (or largest) element in the list. A intuitive solution is to resolve the problem at O(n⋅ lg n), and select the desired element from the corresponding element.
Related Topics