|
|
|
#1
|
|||
|
|||
|
Prove the following recurrence by induction T(n) = 2T(n/2) + n lg n = ? ( n lg^2 n ), T(1) = 1 This to me looks scary and I was wondering if anybody had a heads up on how to solve for this
__________________
Website Development Domain Name Forum |
![]() |
|
|