计算机算法导论_第4章.ppt

Introduction to Algorithms 计算机算法导论 2007~2008年第一学期 Homework Exercises 3.2-4;3.2-7 Problems 3-4 Recurrences Recurrences Three methods for solving recurrences Substitution method Recursion-tree method Master method Recurrences Example Solving recurrences The analysis of merge sort from Lecture 1 required us to solve a recurrence. Recurrences are like solving integrals, differential equations, etc. Lecture 2: Applications of recurrences to divide-and-conquer algorithms. Technicalities Assumption of integer arguments of functions Boundary conditions Floors and ceils 4.1 The substitution method Substitution method The most general method: 1. Guess the form of the solution. 2. Use induction to find the constants and show that the solution works. Substitution method Guess:T(n)=nlgn+n Making a good guess T(n)=2T(n/2+17)+n Similar solution is reasonable Prove loose upper and lower bounds and reduce the range of uncertainty Subtleties T(n)=2T(n/2)+1 Avoiding pitfalls T(n) ≦2c(n/2)+n=cn+n=O(n) Wrong!!!! Changing variables An example An example An example 4.2 The recursion-tree method An example T(n)=T(n/3)+T(2n/3)+Θ(n) An example T(n)=T(n/3)+T(2n/3)+Θ(n) An example T(n)=T(n/3)+T(2n/3)+Θ(n) An example T(n)=T(n/3)+T(2n/3)+Θ(n) 4.3 The master method Homework Exercises 4.1-2;4.1-5 4.2-4 4.3-1;4.3-2 Problems 4-1;4-4 * * Substitution method *