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.

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.

Step by Step Solution

3.41 Rating (164 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

In parts a b and d below we are applying case 3 of the master theorem which requires the regularity condition that a f nb c f n for some constant c 1 ... 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!