Introduction - If you have any usage issues, please Google them yourself
Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically generate at least 1 million points, and the use of the algorithm. In addition, the algorithms required to support graphical user interface input and output. On this basis, add the n ^ 2 Ji Implementation of the algorithm and compare the same scale, the two kinds of algorithm' s time consuming.