2 votes 2 votes Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n-1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer. Algorithms algorithms recurrence-relation + – Tesla! asked Mar 9, 2018 Tesla! 2.7k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply ankitgupta.1729 commented Mar 10, 2018 reply Follow Share @Tesla, I am getting O(n*(3/2)n) using recursion tree method...Please tell me, what is the given answer .. 0 votes 0 votes Tesla! commented Mar 10, 2018 reply Follow Share lower bound is O($n^{2}$) and upper bound is $\Omega(2^{n}$) I can verify lower bound but, unable to verify upper bound 0 votes 0 votes ankitgupta.1729 commented Mar 10, 2018 i edited by ankitgupta.1729 Mar 10, 2018 reply Follow Share Please Correct me where I am wrong.. I think if we ignore T(n/2) here then it will become worst case of Quick sort which will give upper bound as O(n2).. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes time complexity should be o(n^2) abhishekmehta4u answered Mar 10, 2018 abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply Tesla! commented Mar 10, 2018 i edited by Tesla! Mar 10, 2018 reply Follow Share please explain in detail 0 votes 0 votes Please log in or register to add a comment.