Recurrences And Their Solution Methods
Recursion Tree
Just Simplification of Iteration method:
Consider The Recurrences
Second Example
Example Three
Master Method
Cookbook solution for some recurrences of the form
T(n) = a . T(n/b) + f(n)
where a>=1, b>1, f(n) asymptotically positive
Post A Comment:
0 comments so far,add yours