CSE 2320: Algorithms and
Now for the boundary
Making a Good Guess
Guess similar solutions to similar recurrences.
T(n) = 2T(n/2 + 42) + n
T(n) = O(nlgn)
Narrow in on solution using loose upper and lower bounds.
Lower-order terms may defeat mathematical induction of substitution method.
Copyright © 1998 The University of Texas at Arlington