Time Complexity in

Question

What is the time Complexity of 2T(n/2) + nlogn? Can we apply Master's Theorem?

Comments

..........

---

(log(n))^2 and log^2(n) are not same

this should be theta(n(logn)^2)

---

theta(n.(logn)^2)

Answer 1

T(n)=2T(n/2)+nlogn

you can use modified master's theorem

a=2,b=2 ,k=1 ,p=1

b^k=2^1=2=a,p>-1

T(n)=theta(n^log2base2.(log(n))^(1+1))

=>theta(n.(logn)^2)

https://www.youtube.com/watch?v=lPUhHmgrpik