0 votes 0 votes T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused Algorithms recurrence-relation algorithms + – LavTheRawkstar asked Nov 18, 2018 edited Jul 7, 2022 by Lakshman Bhaiya LavTheRawkstar 687 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments LavTheRawkstar commented Nov 18, 2018 reply Follow Share no we cannot remove it as a constant. 0 votes 0 votes Hemanth_13 commented Nov 18, 2018 reply Follow Share Any options and base condition? LavTheRawkstar 0 votes 0 votes goxul commented Nov 18, 2018 reply Follow Share You cannot solve this without a base condition. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes n ^ 2.32 We can remove the constant........ Refer cormen page no. 84 chapter 4 topic- Making a Good Guess. ramcharantej_24 answered May 4, 2020 ramcharantej_24 comment Share Follow See all 0 reply Please log in or register to add a comment.