Introduction To Algorithms

Question

T(N) = 3T(N/4) + NlogN

T(N) = 2T(N/2)+ NlogN

Master theorem applicable to this ??

Answer 1

Second one is not applicable

Comments

I'm talking about this-

---

@abhishekh Mehtasee the pic uploaded by

@verma Ashish according to this ,

a=2,b=2,k=1 so a=$b^k$ is true

So complexity will be $\theta(nlog^2n)$

From where you read about it$(\frac{f(n)}{n^{log_ba}}=log_ba)$then master is not applicable

 

please give the reference about it

---

@abhishek Mehta @shaik

Please suggest whether pic uploaded by Abhishek is correct?