Recurrence examples
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) + n3.
b. T(n) = T(9n/10) + n.
c. T(n) = 16T(n/4) + n2.
d. T(n) = 7T(n/3) + n2.
e. T(n) = 7T(n/2) + n2.
f. ![]()
g T(n) = T(n- l) + n.
h. ![]()
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.