More recurrence examples
Give asymptotic upper and 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) = 5T(n/5) + n/lg n.
c. ![]()
d. T(n) = 3T(n/3 + 5) + n/2.
e.T(n) = 2T(n/2) + n/lg n.
f. T(n) = T(n/2) + T(n/4) + T(n/8) + n.
g. T(n) = T(n-l) + l/n.
h.T(n) = T(n-l) + lg n.
i.T(n) = T(n-2) + 2lg n.
j![]()
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.