判断题：Closest Pair

Recall that, to solve the closest pair problem, the first step of the divide-and-conquer algorithm divides the point set into $$L$$ and $$R$$ according to the x-coordinate. Is the following statement true of false?

> <font size=3>In the combine step of this algorithm, it is always able to find the closest pair with one point in $$L$$ and the other in $$R$$.</font>







答案：FALSE