DataStructures数据结构Course6Recursion教学课件.pptVIP

* 西南财经大学天府学院 LOGO Data Structures(数据结构)Course 6:Recursion Vocabulary Recursion(递归): a repetitive process in which an algorithm call itself, that is recursive algorithm. Stack frame(栈帧）: 在栈中为参数、返回地址和局部变 量保留的一块内存区,必要时在过程 调用中使用。 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 Fibonacci number – Another recursion case The towers of hanoi -- A classic recursive algorithms 1 if n = 0 Factorial(n) = n*(n-1)*(n-2)*…*3*2*1 if n 0 1 if n = 0 Factorial(n) = n*( Factorial(n-1)) if n 0 Factorial(3) = 3* Factorial(2) Factorial(3)=3*2 =6 Factorial(2) = 2* Factorial(1) Factorial(2)=2*1 =2 Factorial(1) = 1* Factorial(0) Factorial(1)=1*1 =1 Factorial(0) = 1 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 Factorial(3) = 3*2*1=6 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 Recursive factorial Algorithm Algorithm recursiveFactorial (val n integer) Calculates the factorial of a number using recursion Pre n is the number to be raised factorially Return n! is returned 1 if (n equal 0) 1 return 1 2 else 1 return (n * recursiveFactorial(n - 1)) 3 end if end recursiveFactorial 6-2 How recursion works How any call works Program testPower Read (base, exp) Result = power(base, exp) Print (b