![]() |
Recurrence by Induction
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
|
| All times are GMT -4. The time now is 01:48 AM. |
Powered by vBulletin®
Copyright ©2000 - 2026, Jelsoft Enterprises Ltd.