15-16-01ADA04(算法分析基础-递归与非递归算法的分析方法II).pptVIP

* * * 2015-2016-01 《Design and Analysis of Algorithm》 SCUN 2007-2008-01《Design and Analysis of Algorithms》SCUEC Review of last class Asymptotic notations ? Mathematical Background Analysis of non-recursive algorithms * * 2015-2016-01 《Design and Analysis of Algorithm》 SCUN Fundamentals of the Analysis of Algorithm Efficiency (III) Chapter 2 1、 Analysis of recursive algorithms 2、 Fibonacci numbers * * 2015-2016-01 《Design and Analysis of Algorithm》 SCUN Goals of this lecture At the end of this lecture, you should Master the plan for analysis of recursive algorithm Master the methods for solving recurrence relations Be familiar with Fibonacci number * * 2015-2016-01 《Design and Analysis of Algorithm》 SCUN Plan for Analysis of Recursive Algorithms Decide on a parameter indicating an input’s size. Identify the algorithm’s basic operation. Check whether the number of times the basic op. is executed may vary on different inputs of the same size. (If it may, the worst, average, and best cases must be investigated separately.) Set up a recurrence relation with an appropriate initial condition expressing the number of times the basic op. is executed. Solve the recurrence (or, at the very least, establish its solution’s order of growth) by backward substitutions or another method. * * 2015-2016-01 《Design and Analysis of Algorithm》 SCUN Recurrence Relations A recurrence relation can be put into an equivalent closed form without the recursion Generation function Characteristics equation Substitution A recurrence relation is a recursive form of an equation, for example: * * 2015-2016-01 《Design and Analysis of Algorithm》 SCUN Example 4: Recursive evaluation of n! Definition: n ! = 1 ? 2 ? … ?(n-1) ? n for n ≥ 1 and 0! = 1 Input size: Basic operation: Best, worst, average case: Recurrence relation: n Multiplication no T(n) = T(n-1) + 1 Recursive definition of n!: F(n) = F(n-1) ? n for n ≥ 1 and