0 votes 0 votes T(N) = 3T(N/4) + NlogN T(N) = 2T(N/2)+ NlogN Master theorem applicable to this ?? Algorithms algorithms master-theorem recurrence-relation + – jatin khachane 1 asked Jul 23, 2018 retagged Jun 18, 2022 by makhdoom ghaya jatin khachane 1 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes Second one is not applicable abhishekmehta4u answered Jul 23, 2018 abhishekmehta4u comment Share Follow See all 15 Comments See all 15 15 Comments reply Show 12 previous comments Verma Ashish commented Aug 14, 2018 reply Follow Share I'm talking about this- 0 votes 0 votes Prince Sindhiya commented Aug 14, 2018 reply Follow Share @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 2 votes 2 votes Mayankprakash commented Nov 2, 2018 reply Follow Share @abhishek Mehta @shaik Please suggest whether pic uploaded by Abhishek is correct? 0 votes 0 votes Please log in or register to add a comment.