Question: Use a recursion tree to determine a good asymptotic upper bound on the recurrence T (n) = 3T (n/2) + n. Use the substitution method
Use a recursion tree to determine a good asymptotic upper bound on the recurrence T (n) = 3T (⌊n/2⌋) + n. Use the substitution method to verify your answer.
Step by Step Solution
3.40 Rating (153 Votes )
There are 3 Steps involved in it
The subproblem size for a node at depth i is n 2 i Thus the tree has log n1 levels and 3 logn ... View full answer
Get step-by-step solutions from verified subject matter experts
