0 votes 0 votes T(n)=4T(√n)+n How can we solve it using master theorem using subsitution and renaming. Algorithms algorithms master-theorem self-doubt + – jatin khachane 1 asked Dec 1, 2018 • retagged Jun 11, 2022 by makhdoom ghaya jatin khachane 1 311 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Utkarsh Joshi commented Dec 1, 2018 reply Follow Share Is it O(n)? 0 votes 0 votes goxul commented Dec 1, 2018 reply Follow Share Is it $O(n \times(\log n)^2 )$? 0 votes 0 votes jatin khachane 1 commented Dec 1, 2018 reply Follow Share I didn't found its answer..can you post your solutions .. 0 votes 0 votes Hemanth_13 commented Dec 1, 2018 reply Follow Share I think it should be $4^{logn}loglogn$ ==>$n^2 loglogn$ 0 votes 0 votes Please log in or register to add a comment.
