Question: Use either Master Theorem Method, Recursion-Tree Method, or Substitution Method (prove the solution if you use substitution). T (n) is constant for small n. Also
Use either Master Theorem Method, Recursion-Tree Method, or Substitution Method (prove the solution if you use substitution). T (n) is constant for small n. Also identify asymptotic tight-bounds (with notation) for T (n) in each of the following recurrences. Show work.
a. (3 points) T (n) = T (n 1) + 3, T (0) = 1 b. (3 points) T (n) = 3T (n/2) + n^2 c. (3 points) T (n) = 4T (n/2) + n log n
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
