Iteration Method Expand the relation so that summation dependent on n is obtained Bound the summation Example T(n)=2T(n/2)+1 T(1)=1 Solution: T(n)=2T(n/2)+1 Let there is k iteration. So, for the first iteration, k=1. K=2 represents second iteration and goes on. Let’s find what is T(n/2) For this, put it in original function T(n) i.e Replace n...
