From multiple sources, I\'ve learned that in the divide and conquer closest pair algorithm, when finding the special cases (pairs of points in different halves), you scan for at
