Our goal: show that
T(n) = 2T(?n/2?) + n = O(n lg n)
Thus, we need to show that T(n) ? c n lg n with an appropriate choice of c
- Inductive hypothesis: assume
T(?n/2?) ? c ?n/2? lg ?n/2?
- Substitute back into recurrence to show thatT(n) ? c n lg n follows, when c ? 1(show on board)