2 votes 2 votes T(N)=3T((N/3)+5)+N/2 what will be the time complexity? Algorithms algorithms time-complexity + – Rajeev Kumar 1 asked Jan 9, 2018 Rajeev Kumar 1 760 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Mk Utkarsh commented Jan 9, 2018 i edited by Mk Utkarsh Jan 9, 2018 reply Follow Share $\Theta (nlogn) $ ? 0 votes 0 votes Ashwin Kulkarni commented Jan 9, 2018 reply Follow Share I also got Θ(nlogn) 0 votes 0 votes Rajeev Kumar 1 commented Jan 9, 2018 reply Follow Share in clrs book only question is given and i also got nlogn using master theorem. 0 votes 0 votes Please log in or register to add a comment.