分治法 Divide and Conquer - Closest Pair of Points 找最近点对
分治法找最近点对,可以把时间复杂度从暴力的O(n^2)降低到O(nlogn)We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number
原创
2014-02-21 02:16:41 ·
7321 阅读 ·
1 评论