## Closest Pair, Part 2

### February 13, 2015

In a previous exercise we studied the brute-force method for finding the closest pair of points in a set of points by forming all pairs, computing the distance between each of them, and choosing the smallest. That algorithm has time complexity O(*n*^{2}). Today we will look at a divide-and-conquer algorithm that has time complexity O(*n* log *n*.

The divide-and-conquer algorithm sorts the pairs along their *x*-coordinates, splits the list of pairs in two, recursively finds the closest pair in the two halves, then compares all points for the closest pair that crosses the dividing line between the two sets of points, taking the minimum of the three possibilities. The third possibility is the tricky one. It won’t do to consider all possible pairs. Instead, we consider only those points less than *d* distance from the dividing line, where *d* is the minimum of the distances of the two recursive calls. It can be proved, though we won’t do so here, that the third step takes only linear time, so the entire algorithm is O(*n* log *n*).

Your task is to write a program that computes the closest pair of points in an input set using the divide-and-conquer algorithm. When you are finished, you are welcome to read or run a suggested solution, or to post your own solution or discuss the exercise in the comments below.

I was jumping the gun a bit with my solution to Part I.

Do you use the fact that the ys list is sorted?

Takes about 4.5 seconds to find closest pair in a set of 1000000 points–much faster than brute-force method.

Example: