Solve this recurrence equation using Master's theorem
T(n) = 64 T(n/8) - n 2 log n
Please tell how to apply Akra Bazii in the following recurrence :
T(n)=T(n/2)+ T(n/4) +n2
Following 2 case are possible :
1.) For worst case , recurrence relation is
T(n) = 2T(n/2) + n2 {as T(n/2) is larger problem then T(n/4) }
2.) For best case , recurrence relation is
T(n)= 2 T(n/4) + n2
As this N2logN Function is decreasing Master Theorem can not be applied here..
what do u mean by (N2 LOG N ) IS DECREASING ?
Using Advanced master's theorem https://www.geeksforgeeks.org/advanced-master-theorem-for-divide-and-conquer-recurrences/ T(n) = Θ($n^{2}$loglogn)
64.3k questions
77.9k answers
243k comments
79.6k users