Explain 'Divide and Conquer' for Closest Pair of Points.

Explain 'Divide and Conquer' for Closest Pair of Points.

Approach: Describe the O(n log n) algorithm for finding the closest two points.

The problem is split by a vertical line. Recursively find min distances in left and right halves. Then, check points in a central strip to see if a closer pair crosses the split line.

Follow-up: How many points in the strip need to be checked for each point?

Key concepts: recursion, sorting, strip.