数据结构第9讲(浙江工业大学).pptVIP

Recursive Definition of the Power Function A recursive definition distinguishes between the exponent n = 0 (starting point) and n ? 1 which assumes we already know the value xn-1. After determining a starting point, each step uses a known power of 2 and doubles it to compute the next result. Using this process gives us a new definition for the power function, xn. We compute all successive powers of x by multiplying the previous value by x. Stopping Conditions for Recursive Algorithms Use a recursive function to implement a recursive algorithm. The design of a recursive function consists of Implementing the Recursive Power Function 汉诺塔问题 Solving the Tower of Hanoi Puzzle using Recursion Solving the Tower of Hanoi Puzzle using Recursion Solving the Tower of Hanoi Puzzle using Recursion Hanoi using Recursion Hanoi using Recursion Hanoi using Recursion Hanoi using Recursion Fibonacci Numbers using Recursion Fibonacci Numbers using Recursion Fibonacci Numbers using Recursion Fibonacci Numbers using Recursion Fibonacci Numbers using Recursion Fibonacci Numbers using Iteration Fibonacci Numbers using Iteration Multibase Multibase The Greatest Common Divisor：最大公约数 Main Index Contents * * Main Index Contents Recursive Case—Power Function Recursive Case－Hanoi Tower Recursive Case－ Fibonacci Iterative Case－Fibonacci Recursive Case– Multibase Recursive Case-- Greatest Common Divisor Lecture 9 - Recursive * Main Index Contents 1. One or more stopping conditions that can be directly evaluated for certain arguments. 2. One or more recursive steps in which a current value of the function can be computed by repeated calling of the function with arguments that will eventually arrive at a stopping condition. * Main Index Contents Recursive power(): double power(double x, int n) // n is a non-negative integer { if (n == 0) return 1.0; // stopping condition else return x * power(x,n-1); // recursive step } 　 在印度，有一个古老的传说：在世界中心贝拿勒斯（在印度北部）的圣庙里，一块黄铜板