Given a list of points of coordinates (x, y)
find the closest pair of points that has the minimum distance d between points.
- Brute Force Solution
O(n^2)
- Divide And Conquer Solution
O(n log n)
The closest pair problem is a problem of computational geometry
Jupyter Notebook