0 votes 0 votes Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then $A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ $D)T(n)=\theta(n^{3}logn)$ Algorithms algorithms recurrence-relation time-complexity + – Lakshman Bhaiya asked Nov 1, 2018 Lakshman Bhaiya 413 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Utkarsh Joshi commented Nov 1, 2018 reply Follow Share n^2. By tree method im getting. 0 votes 0 votes adarsh_1997 commented Nov 1, 2018 reply Follow Share c) T(N/4)<=T(N/2) USE THIS AND APPLY MASTER THEOREM 0 votes 0 votes adarsh_1997 commented Nov 1, 2018 reply Follow Share @UTKARSH JOSHI CAN YOU SHARE THE TREE METHOD? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option c)Theta(n^2) by recursive tree method. shagilsid answered Nov 4, 2018 shagilsid comment Share Follow See all 0 reply Please log in or register to add a comment.