next up previous
Next: Analysis of Merge Sort Up: CSE 2320: Algorithms and Previous: Analyzing Divide-and-Conquer Algorithms

For larger input size:



Thus we generate the recurrence:


\begin{displaymath}T(n) = \left\{ \begin{array}{ll}
\Theta(1) & {\rm if} \; n \...
...
a T(n/b) + D(n) + C(n) & {\rm otherwise}
\end{array} \right.\end{displaymath}



Copyright © 1998 The University of Texas at Arlington