0 votes 0 votes Deepalitrapti asked Nov 25, 2018 Deepalitrapti 302 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Nilabja Sarkar commented Nov 25, 2018 reply Follow Share yes applicable 0 votes 0 votes Deepalitrapti commented Nov 25, 2018 reply Follow Share How?? What is time complexity 0 votes 0 votes Deepanshu commented Nov 25, 2018 reply Follow Share nope not applicable at all.... master theorem extend master theorem--------- yesssss 0 votes 0 votes Deepalitrapti commented Nov 25, 2018 reply Follow Share How not applicable?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes T(n)=aT(n/b)+f(n) Then use master theorem T(n) = aT(n/b) + Θ(n^klog^pn) a≥1,b>1,k≥0 p = real number this is extended masters theorem complexity O(n) Nilabja Sarkar answered Nov 25, 2018 Nilabja Sarkar comment Share Follow See all 0 reply Please log in or register to add a comment.