1 votes 1 votes is the time complexity for this fuction is O(n)? Algorithms algorithms master-theorem time-complexity + – set2018 asked Aug 17, 2017 set2018 599 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments set2018 commented Aug 17, 2017 reply Follow Share http://www.csd.uwo.ca/~moreno//CS424/Ressources/master.pdf see point no 7 0 votes 0 votes smsubham commented Aug 17, 2017 reply Follow Share In point 7 solutions it's only mentioned it cannot be solved using master Theorem which is quite evident. Can please you provide a solution to this using some other method ? 0 votes 0 votes set2018 commented Aug 17, 2017 reply Follow Share @Bikram sir 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 1 when T(n)=2T(n/2)+n then a=2 ,b=2 ,k=1 then we apply the condition a>b^k which give us a=b then T(n)=@(nlogn) (@= theta_) 2.when T(n)=2T(n/2)+logn then apply same method we get T(n)=@(n) (@= theta) air1ankit answered Aug 17, 2017 air1ankit comment Share Follow See all 3 Comments See all 3 3 Comments reply set2018 commented Aug 17, 2017 reply Follow Share see pdf 0 votes 0 votes air1ankit commented Aug 17, 2017 reply Follow Share PDF???? 0 votes 0 votes set2018 commented Aug 17, 2017 reply Follow Share http://www.csd.uwo.ca/~moreno//CS424/Ressources/master.pdf see point no 7 0 votes 0 votes Please log in or register to add a comment.