next up previous
Next: Solution Techniques Up: l2 Previous: Recurrences

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
Next: Solution Techniques Up: l2 Previous: Recurrences