Closest Pair Problem

External

• https://www.coursera.org/learn/algorithms-divide-conquer/lecture/nf0jk/o-n-log-n-algorithm-for-closest-pair-i-advanced-optional
• https://www.coursera.org/learn/algorithms-divide-conquer/lecture/cER7y/o-n-log-n-algorithm-for-closest-pair-ii-advanced-optional

Internal

• Algorithms | Divide and Conquer

Problem

Given n pair of points in the plane, figure out which points are closest to each other.

[Next]