CSE 326 Lecture 3, Analysis of Recursive Algorithms.pptVIP

CSE 326: Data StructuresLecture #3Analysis of Recursive Algorithms Alon Halevy Fall Quarter 2000 Nested Dependent Loops for i = 1 to n do for j = i to n do sum = sum + 1 Recursion A recursive procedure can often be analyzed by solving a recursive equation Basic form: T(n) = if (base case) then some constant else ( time to solve subproblems + time to combine solutions ) Result depends upon how many subproblems how much smaller are subproblems how costly to combine solutions (coefficients) Example: Sum of Integer Queue sum_queue(Q){ if (Q.length == 0 ) return 0; else return Q.dequeue() + sum_queue(Q); } One subproblem Linear reduction in size (decrease by 1) Combining: constant c (+), 1×subproblem Equation: T(0) ? b T(n) ? c + T(n – 1) for n0 Sum, Continued Equation: T(0) ? b T(n) ? c + T(n – 1) for n0 Solution: Example: Binary Search One subproblem, half as large Equation: T(1) ? b T(n) ? T(n/2) + c for n1 Solution: Example: MergeSort Split array in half, sort each half, merge together 2 subproblems, each half as large linear amount of work to combine T(1) ? b T(n) ? 2T(n/2) + cn for n1 Example: Recursive Fibonacci Recursive Fibonacci: int Fib(n){ if (n == 0 or n == 1) return 1 ; else return Fib(n - 1) + Fib(n - 2); } Running time: Lower bound analysis T(0), T(1) ? 1 T(n) ? T(n - 1) + T(n - 2) + c if n 1 Note: T(n) ? Fib(n) Fact: Fib(n) ? (3/2)n O( (3/2)n ) Why? Direct Proof of Recursive Fibonacci Recursive Fibonacci: int Fib(n) if (n == 0 or n == 1) return 1 else return Fib(n - 1) + Fib(n - 2) Lower bound analysis T(0), T(1) = b T(n) = T(n - 1) + T(n - 2) + c if n 1 Analysis let ? be (1 + ?5)/2 which satisfies ?2 = ? + 1 show by induction on n that T(n) = b?n - 1 Direct Proof Continued Basis: T(0) ? b b?-1 and T(1) ? b = b?0 Inductive step: Assume T(m) ? b?m - 1 for all m n T(n) ? T(n - 1) + T(n - 2) + c ? b?n-2 + b?n-3 + c ? b?n-3(?