Analysis

Initial Sorts: O(n lg n)

Closest Pair:

$$T(n) = \left\{ \begin{array}{ll} \Theta(1) & {\rm if} \; n \... ... 2T(n/2) + \Theta(n) & {\rm if} \; n > 3 \end{array} \right.$$

a = 2, b = 2, f(n) = = , case 2

T(n) =

Closest-Pair algorithm takes time.