Median of Medians
Median of Medians is a deterministic selection algorithm that chooses a pivot with guaranteed quality. It divides elements into groups, commonly groups of five, finds each group's median, recursively finds the median of those medians, and partitions around that pivot. This guarantees linear worst-case time for selection, unlike randomized Quickselect, whose worst case is quadratic.
Provides deterministic O(n) worst-case selection.
Randomized Quickselect provides expected O(n).
Median-of-medians has higher constants in practice.
Useful when worst-case guarantees are more important than constant factors.