811 views

3 Answers

1 votes
1 votes

3rd Case of Masters Theorem, as mentioned in http://www.cse.unt.edu/~tarau/teaching/cf1/Master%20theorem.pdf


$T(n) = \Theta (2^n)$

Related questions

0 votes
0 votes
1 answer
1
lolster asked Jun 12, 2019
1,274 views
How to check if a given recurrence relation is in a format that is valid to apply Master’s Theorem? Also, how to distinguish between Master’s Theorem and extended Mas...
0 votes
0 votes
0 answers
3
pradeepchaudhary asked Aug 20, 2018
890 views
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
0 votes
0 votes
2 answers
4
manvi_agarwal asked Aug 10, 2018
1,667 views
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2