Chapter 10: Recursion

Preview:

DESCRIPTION

Chapter 10: Recursion. Problem Solving and Program Design in C 5th Edition by Jeri R. Hanly and Elliot B. Koffman. Figure 10.1 Splitting a Problem into Smaller Problems. Figure 10.2 Recursive Function multiply. Figure 10.3 Thought Process of Recursive Algorithm Developer. - PowerPoint PPT Presentation

Citation preview

Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Chapter 10: Recursion

Problem Solving and Program Design in C 5th Edition

by Jeri R. Hanly and Elliot B. Koffman

2Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.1 Splitting a Problem into Smaller Problems

3Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.2 Recursive Function multiply

4Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.3 Thought Process of Recursive Algorithm Developer

5Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.4 Recursive Function to Count a Character in a String

6Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.5 Trace of Function multiply

7Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.6 Function reverse_input_words

8Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.7 Trace of reverse_input_words(3) When the Words Entered are "bits" "and" "bytes"

9Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.8 Sequence of Events for Trace of reverse_input_words(3)

10Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.9 Recursive Function multiply with Print Statements to Create Trace and Output from multiply(8, 3)

11Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.9 Recursive Function multiply with Print Statements to Create Trace and Output from multiply(8, 3) (cont’d)

12Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.10 Recursive factorial Function

13Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.11 Trace of fact = factorial(3);

14Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.12 Iterative Function factorial

15Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.13 Recursive Function fibonacci

16Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.14 Program Using Recursive Function gcd

17Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.14 Program Using Recursive Function gcd (cont’d)

18Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.15 Recursive Function to Extract Capital Letters from a String

19Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.16 Trace of Call to Recursive Function find_caps

20Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.17 Sequence of Events for Trace of Call to find_caps from printf Statements

21Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.18 Trace of Selection Sort

22Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.19 Recursive Selection Sort

23Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.19 Recursive Selection Sort (cont’d)

24Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings

25Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

26Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

27Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

28Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

29Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

30Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.21 Towers of Hanoi

31Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.22 Towers of Hanoi After Steps 1 and 2

32Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.23 Towers of Hanoi After Steps 1, 2, 3.1, and 3.2

33Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.24 Recursive Function tower

34Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.25 Trace of tower ('A', 'C', 'B', 3);

35Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.26 Output Generated by tower('A', 'C', 'B', 3);

36Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Figure 10.27 Grid with Three Blobs

Recommended