Next: Up: Previous:

For example, MergeSort

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

$T(n) = \Omega(n \lg n)$

Next: Up: Previous: