Give asymptotic upper an= lower bounds for T (n) in each of the following recurrences. Assume that
Question:
Give asymptotic upper an= lower bounds for T (n) in each of the following recurrences. Assume that T (n) is constant for sufficiently small n. Make your bounds as tight as possible, and justify your answers.
a. T (n) = 3T (n/2) + n lg n
b. T (n) = 4T (n/2) + n2√n.
c. T (n) = 2T (n/2) + n/ lg n.
d. T (n) = T (n/2) + T (n/4) + T (n/8) + n.
e. T (n) = T(n - 1) + 1/n.
f. T (n) = T(n - 1) + lg n.
g. T (n) = T (n - 2) + 2 lg n
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: