Lect_5 Recursive递归算法课鉴.pptVIP

Topic 3 Recursion 【See Chap17.1 in the textbook】 A powerful problem-solving strategy that is defined as any solution technique in which large problems are solved by reducing them to smaller problems of the same form. Recursion Both strategies involve decomposition. What makes recursion special is that the sub-problems in a recursive solution have the same form as the original problem. Recursion vs. step-wise refinement Problem：Imagine that you have been appointed as the funding coordinator for a large charitable organization. Your job is to raise $1,000,000 in contributions so that the organization can meet its expenses. A simple illustration of recursion Strategy： void CollectCountributions (int n) { if (n = 100) { Collect the money from a single donor. } else { Find 10 volunteers. Get each volunteer to collect n/10 dollars. Combine the money raised by the volunteers. } } CollectCountributions (n / 10); Problem：Compute the factorial of integer n — n! The Factorial function(1) Strategy1(using loop): n! = 1*2*3*……*(n-1)*n int Factorial (int n) { int product, i; product = 1; for (i = 1; i = n; i++) { product *= i; } return (product); } The Factorial function(2) The frames of Factorial function call(1) main: fact = Factorial(4); The frames of Factorial function call(2) Factorial(4): call: Factorial(3); The frames of Factorial function call(3) Factorial(3): execute: Factorial(3); The frames of Factorial function call(4) Factorial(2): execute: Factorial(2); The frames of Factorial function call(5) Factorial(0): execute: Factorial(0); The frames of Factorial function call(6) Factorial(1): return 1*1; The frames of Factorial function call(7) Factorial(2): return 2*1; The frames of Factorial function call(8) F