+1 vote
179 views
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.
0

@Tesla, I am getting O(n*(3/2)n) using recursion tree method...Please tell me, what is the given answer ..

0
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

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)..

time complexity should be o(n^2)
0

+1 vote
1
2