- Guess similar solutions to similar recurrences.
T(n) = 2T(n/2 + 42) + nGuess: T(n) = O(nlgn)

- Narrow in on solution using loose upper and lower bounds.
O()

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