Question: 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
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) + nl lg n. T(n) = 4T (n/2) + n' n 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- 1) + 1/n. %3D c. h. m) %3 ( -1) + 1g n. i. T(n) = T(n - 2) + 2 lg n. j. T(n) = nT (n) +n.
Step by Step Solution
3.40 Rating (163 Votes )
There are 3 Steps involved in it
This problem is solved only for parts a c e f g h and i a Tn 3T n2 nlgn We have fn ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
C-S-A (83).docx
120 KBs Word File
