该程序实现对一维数据轴上的最临近点的求解问题

采用方法：分治方法1（该方法在递归时由于使用数组的值，使得

递归进栈的数据很多，消耗系统空间很大，所以最多

　　　　 处理的个数经测试不超过70个，可见在设计程序时，考虑

　　　　 空间的使用也是很必要的！）-The realization of the program of one-dimensional data point near the axis of the most used method of solving the problem: separation of Method 1 (recursive when the method is the use of an array of value, making recursive stack data into a lot of consumption of the system is much room for Therefore, the largest number of processing have been tested not more than 70 shows in the design process, consider the use of space is also very necessary!)