http://en.wikipedia.org/wiki/Master_theorem
-Vijju
On 5/25/06,
A S Grewal <[EMAIL PROTECTED]> wrote:
Hi Everyone,
Does anyone know how one could compute the order of the following
recursive function :
T(n) = 4 T(n/2) + n^2 (lg n)
Also, how do you handle floor and ceiling functions while determining
order? I think they can just be ignored but is there a more rigorous
mathematical method to determine the order?
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
