882 views

1 Answer

Best answer
1 votes
1 votes

Some of the good resources I found to get a hold on the concepts:

https://www.geeksforgeeks.org/analysis-algorithm-set-4-master-method-solving-recurrences/

http://www.cs.cmu.edu/~rweba/algf09/solverecurrencesSF.pdf

https://stackoverflow.com/questions/46858401/time-complexity-and-recurrence-relation

After reading them thoroughly, solve previous year GATE questions on the topics, and the questions from any other coaching institutes' books like "Practice book for PSUs".

Practice is the only solution for getting a firm understanding of this topic.

selected by

Related questions

1 votes
1 votes
1 answer
1
aka 53 asked Nov 25, 2017
328 views
Base condition T(n) = 1Otherwise T(n) = T(n-1) +n Then After solving i got to this step ...how should i generalize nowT(n) = T( n-k) + n-(k-1) + n-(k-2)+n
0 votes
0 votes
2 answers
2
sahil_malik asked Sep 11, 2018
316 views
T(n) = 3T( n/3 ) + n/2The answer to the above question says that case 2 of masters theorem is applied here. How is it so?
0 votes
0 votes
1 answer
3
shashi111 asked Aug 27, 2017
526 views
Consider the following recurrence.T(n) = T() + What is the value of recurrence?please explain in detail
1 votes
1 votes
1 answer
4
sripo asked Nov 14, 2018
1,622 views
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1