《数据结构与算法》Chap4recursion.pptVIP

Data Structures and Algorithms Chapter 4: Recursions;;Highlights; 1 if n = 0 Factorial(n) = n*( Factorial(n-1)) if n 0;Iterative factorial Algorithm;Calling a recursive algorithm;;Algorithm power (base, exp ) This algorithm computes the value of a number,base, raised to the power of an exponent ,exp. Pre base is the number to be raised Post value of base raised to power exp computed return value of base raised to power exp returned 1 If (exp equal 0) 1 return (1) 2 Else 1 return (base * power (base, exp – 1 )) 3 End if End power;;The design methodology Every recursive algorithm have two elements: base case – solve a part of the problem general case – reduce the size of the problem ;Limitation of recursion;Design implementation-- reverse keyboard input;Print linked list in reverse;Algorithm Analysis;;Fibonacci number – another case study;The algorithm of Fib(n); The towers of hanoi ;Towers solution for two disks;Towers call for three disks;Steps of generalize the problem: case 1 : if we have only one disk to move case 2 : if we have two disk to move case 3 : if we have three disk to move ;generalization case : if we have n disk to move ;Need four parameters : number of disks, source needle, destination needle, auxiliary needle, three moves are :;The algorithm of towers of hanoi:;Tracing of Algorithm towers;Summary of this chapter;Summary of this chapter (Continue);Vocabulary;homework