The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
170 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.
asked in Algorithms by Boss (16.6k points) | 170 views
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)..

1 Answer

0 votes
time complexity should be o(n^2)
answered by Boss (23.3k points)
0
please explain in detail


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,619 questions
46,721 answers
140,297 comments
58,015 users