华南理工大学数据结构与算法课件Chapter12 Divide-and-Conquer Algorithm.pptVIP

The following analysis is the complexity of the algorithm deals with this problem. Let t(n) represents the time of function close to process the n points. When n4, t(n) is equal to a constant d. When n≥4, we need take(n) time to complete the following: divide the set of points into two parts, reconstruct Y after twice recursive call Y, eliminate the point that far from the dividing lines, search for better second class point pair. The time cost of twice recursive calls are t(「n/2」) and t(n/2), which can be obtained recursively t(n)=O(nlog n). In addition, the function closest needs O(nlog