Selection and closest pair
Kent Quanrud · 51:20
You can select the *k*-th smallest element in O(n) time without sorting, and find the closest pair among *n* points in the plane in O(n log n) time, both by divide-and-conquer. The lecture builds selection from an ide...