0 votes 0 votes Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+T(n/2) +n$.Use the substitution method to verify your answer. Algorithms cormen algorithms recurrence-relation descriptive + – akash.dinkar12 asked Apr 5, 2019 • edited May 8, 2020 by KUSHAGRA गुप्ता akash.dinkar12 369 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Arjun commented May 9, 2020 reply Follow Share Whats the confusion there? 0 votes 0 votes KUSHAGRA गुप्ता commented May 9, 2020 reply Follow Share @Arjun Sir, it's a total confusion for me as I don't know how to solve in a way given in github solution. I used to draw a tree like this : 0 votes 0 votes Arjun commented May 10, 2020 reply Follow Share That will be done when the tree is complete. Otherwise we cannot do the exact calculation like you have done. So, we can get the lower bound by restricting the tree to that level till which the tree is complete and upper bound by considering the tree as complete till the last level 0 votes 0 votes Please log in or register to add a comment.