next up previous
Next: Example: Up: CSE 2320: Algorithms and Previous: Now for the boundary

Making a Good Guess

Guess similar solutions to similar recurrences.

T(n) = 2T(n/2 + 42) + n


Narrow in on solution using loose upper and lower bounds.

$\Omega(n)$ $\longrightarrow$ $\Theta(nlgn)$ $\longleftarrow$ O(n2)

Problems: Lower-order terms may defeat mathematical induction of substitution method.

Copyright © 1998 The University of Texas at Arlington