Solving Recurrences using Iteration Method
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
Design and Analysis of Algorithms (DAA) – Micro Syllabus
Foundation of Algorithm Analysis Algorith and its properties RAM Model Time and Space Complexity Detail Analysis of Algorithm (Like Factorial Algorithm) Concept of Aggregate Analysis Asymptotic Notation Big Oh, Big
Algorithm, RAM Model, Asymptotic Notation
Algorithm Finite set of computational instructions Set of steps to solve the problem Properties: Input / output : some input from some standard set of input and must produce output