Quickselect

Quickselect is an efficient algorithm used to find the k-th smallest (or largest) element in an unordered list. It is related to the Quicksort sorting algorithm and uses a similar partitioning approach.