Divide and Conquer | Set 2 (Closest Pair of Points) We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Recall the following formula for distance between two points p and q. The Brute force solution is O(n^2), compute the distance between each pair and return the smallest.
Read full article from Divide and Conquer | Set 2 (Closest Pair of Points) | GeeksforGeeks
No comments:
Post a Comment