资 源 简 介
该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!)
