数据结构——递归.pptVIP

Vocabulary Recursion(递归): a repetitive process in which an algorithm call itself, that is recursive algorithm. Factorial(阶乘): the product of the integral values from 1 to the number. Fibonacci number(斐波纳契数列) The towers of hanoi(汉诺塔) Highlights in this chapter Factorial – A classical recursive case How recursion works Designing recursion algorithms Fibonacci number – Another recursion case The towers of hanoi -- A classic recursive algorithms 6-1 Factorial – A case study Factorial definition: the factorial of a number is product of the integral values from 1 to the number. Iteration algorithm definition Recursion algorithm definition Iterative factorial Algorithm Algorithm iterativeFactorial (val n integer) Calculates the factorial of a number using a loop. Pre n is the number to be raised factorially Return n! is returned 1 i = 1 2 factN = 1 3 loop (i = n) 1 factN = factN * i 2 i = i + 1 4 end loop 5 return factN end iterativeFactorial 6-2 How recursion works How any call works 6-3 Designing recursive algorithm Design implementation reverse a linked list We need to print the list in reverse but not have reverse pointers: Algorithm Analysis 6-4 Fibonacci number – another case study Fibonacci number: Fibonacci number are a series in which each number is sum of the previous two numbers. The first few number in Fibonacci number are : Design algorithm of Fib(n): base case: Fib(0) = 0 , n = 0 Fib(1) = 1 , n = 1 general case : Fib (n) = Fib (n - 1) + Fib (n - 2) 6-5 The towers of hanoi The towers of hanoi: monks had a set of three diamond needle, stacked on the first needle were 64 gold disk of decreasing size. The monks move one disk to another needle each hour, subject ti the following rules: 1. Only one disk could be moved at a time. 2. A large disk must never be stacked above a smaller one. 3. One and only one auxiliary needle could be u