reopened by
548 views
1 votes
1 votes
$T(n)= \begin{Bmatrix} 2^{n}T(n-1)+c& n>0\\ 1 & n=0 \end{Bmatrix}$
reopened by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Supremo asked Feb 4, 2017
326 views
$T(n) = \begin{Bmatrix} T(\frac{n}{k})+T(\frac{3n}{4})+n\ \ \ if\ n\geq2\\ 1 \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ if\ n=1 \end{Bmatrix}$
1 votes
1 votes
1 answer
2
VikramRB asked Jan 20, 2019
1,005 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$