## We can solve this recurrence using the dreaded substitution method

- Guess the answer
- T(n) = O(n lg n)

- Assume that the inductive hypothesis holds
- T(n) ? an lg n + b for some constants a and b

- Substitute it in for some value < n
- The value k in the recurrence

- Prove that it follows for n

- Guess the answer

Previous slide | Next slide | Back to first slide | View graphic version |