Given a set of 2D points, the mission is to find the closest pair.

Naive strategy would be to examine all the pairs and choose the closest one. But naive is also expensive, leading to O(n²) time complexity.