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.

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

Step by Step Solution

3.32 Rating (167 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a T n 3T n2 n lg n We have f n n lg n and n log b a n lg 3 n 1585 SincenlgnOn lg 3 for any0 0 We hav... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction to Algorithms Questions!