Problem 1: Recurrences
b.
T(n) = 2T(n/2) + n lg
^{2}
n
n
This is a tricky one!
What case of the master
theorem applies?
l
Answer: case 2, as generalized in Ex 4.4.2:
n
if
, where
k
³
0, then
n
Thus T(n) = O(n lg
^{3}
n)