Problem
1. Give an algorithm that, given a set of 2/V points, half with positive .r coordinates, half with negative x coordinates, finds the closest pair with one member of the pair in each half.
2. Give the successive pairs of points assigned to col and cp2 when the program in the text is run on the example points, but with A removed.
3. Test the effectiveness of making min global by comparing the performance of the implementation given to a purely recursive implementation for some large random point set.