Sep 26, 2020 · In this post, practice problems on the analysis of algorithms are discussed. Problem 1: Find the complexity of below recurrence: { 3T(n-1), if n>0, T(n) = { 1, otherwise
(write your answers in the form of coefficientx10^exponent) If your answer is 3.5 x 10 3 you should type 3.5x10^3 in the box then click the submit button). (2 X 10 3 )(4X10 4 )= (6 X 10 5 )(7 X 10 6 )=