Give asymptotic upper and lower bounds for T (n) in each of the following recurrences. Assume that
Question:
Give asymptotic upper and lower bounds for T (n) in each of the following recurrences. Assume that T (n) is constant for n ≤ 2. Make your bounds as tight as possible, and justify your answers.
a. T (n) = 2T (n/2) + n4.
b. T (n) = T (7n/10) + n.
c. T (n) = 16T (n/4) + n2.
d. T (n) = 7T (n/3) + n2.
e. T (n) = 7T (n/2) + n2.
f. T (n) = 2T (n/4) + √n.
g. T (n) = T(n - 2) + n2.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Question Posted: