Quickselect finds the k-th smallest element by partitioning like QuickSort, but recursing only into one side. Average time is O(n), worst case is O(n²) (bad pivots).