Welcome![Sign In][Sign Up]
Location:
Search - devide_conquer

Search list

[Data structsdevide_conquer

Description: 分治法解最近点对问题:首先输入点的个数,然后输入点的坐标,输出先是根据x的坐标对点进行排序,然后输出最近点对的距离。-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.
Platform: | Size: 6144 | Author: 张英霞 | Hits:

CodeBus www.codebus.net