完成一维的最接近点对问题，用的是分治算法进行的-The closest point to complete one-dimensional problem, using a partition algorithm of

完成一维，二维，的最接近点对问题，还有界面-Complete the one-dimensional, two-dimensional, the closest point on the issue, as well as the interface

一次大型的party最后节目是选取一位幸运人士；完成一维的最接近点对问题 第k小的元素-A large party last program is to select a lucky person complete the one-dimensional closest point problems small element of the k