《计算模型与算法技术教学课件》2-Fundamentals of the Analysis of Algorithm Efficiency.pptVIP

* * * * * * * * * * * * * * * Note the difference between the two recurrences. Students often confuse these! F(n) = F(n-1) n F(0) = 1 for the values of n! ------------ M(n) =M(n-1) + 1 M(0) = 0 for the number of multiplications made by this algorithm * * * * * * * * * * * * * * Computing Fibonacci numbers Definition-based recursive algorithm Nonrecursive definition-based algorithm Explicit formula algorithm Logarithmic algorithm based on formula: F(n-1) F(n) F(n) F(n+1) 0 1 1 1 = n for n≥1, assuming an efficient way of computing matrix powers. * * * 2.6 Empirical Analysis