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