1 votes 1 votes T(n) = 2T(n/2) + nlogn a. O(nlogn) b.n(log^2n) c.O(n^2) Algorithms algorithms master-theorem time-complexity + – dragonball asked Dec 19, 2017 dragonball 576 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu007 commented Dec 19, 2017 reply Follow Share O(nlog2 n ) 0 votes 0 votes Pawan Kumar 2 commented Dec 19, 2017 reply Follow Share master's theorom : a=1 b=1, k=1 p=1 a=bk ,p>-1 nlogbalogp+1n= nlog2n 1 votes 1 votes Sona Barman commented Jan 7, 2018 reply Follow Share This is the answer. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes https://gateoverflow.in/?qa=blob&qa_blobid=7420582609919252688 the question satisfies rule (ii-a)(see the pic), so answer is option -b Sai Krishna Datt answered Dec 19, 2017 Sai Krishna Datt comment Share Follow See all 0 reply Please log in or register to add a comment.