Description: Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of the points x sort, and then output the nearest point of the distance.
- [divide] - Sub-rule method for nearest point on the
File list (Check if you may need any files):
devide_conquer
..............\zuijingdiandui2.cpp
..............\zuijingdiandui2.exe
..............\分治法解最近点对问题.txt
Download