chapter 10: recursion

36
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

Upload: myra-boone

Post on 15-Mar-2016

75 views

Category:

Documents


3 download

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

TRANSCRIPT

Page 1: Chapter 10: Recursion

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

Page 2: Chapter 10: Recursion

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

Figure 10.1 Splitting a Problem into Smaller Problems

Page 3: Chapter 10: Recursion

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

Figure 10.2 Recursive Function multiply

Page 4: Chapter 10: Recursion

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

Figure 10.3 Thought Process of Recursive Algorithm Developer

Page 5: Chapter 10: Recursion

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

Figure 10.4 Recursive Function to Count a Character in a String

Page 6: Chapter 10: Recursion

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

Figure 10.5 Trace of Function multiply

Page 7: Chapter 10: Recursion

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

Figure 10.6 Function reverse_input_words

Page 8: Chapter 10: Recursion

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"

Page 9: Chapter 10: Recursion

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

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

Page 10: Chapter 10: Recursion

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)

Page 11: Chapter 10: Recursion

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)

Page 12: Chapter 10: Recursion

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

Figure 10.10 Recursive factorial Function

Page 13: Chapter 10: Recursion

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

Figure 10.11 Trace of fact = factorial(3);

Page 14: Chapter 10: Recursion

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

Figure 10.12 Iterative Function factorial

Page 15: Chapter 10: Recursion

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

Figure 10.13 Recursive Function fibonacci

Page 16: Chapter 10: Recursion

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

Figure 10.14 Program Using Recursive Function gcd

Page 17: Chapter 10: Recursion

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

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

Page 18: Chapter 10: Recursion

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

Figure 10.15 Recursive Function to Extract Capital Letters from a String

Page 19: Chapter 10: Recursion

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

Figure 10.16 Trace of Call to Recursive Function find_caps

Page 20: Chapter 10: Recursion

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

Page 21: Chapter 10: Recursion

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

Figure 10.18 Trace of Selection Sort

Page 22: Chapter 10: Recursion

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

Figure 10.19 Recursive Selection Sort

Page 23: Chapter 10: Recursion

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

Figure 10.19 Recursive Selection Sort (cont’d)

Page 24: Chapter 10: Recursion

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

Figure 10.20 Recursive Set Operations on Sets Represented as Character Strings

Page 25: Chapter 10: Recursion

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

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

Page 26: Chapter 10: Recursion

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

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

Page 27: Chapter 10: Recursion

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

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

Page 28: Chapter 10: Recursion

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

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

Page 29: Chapter 10: Recursion

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

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

Page 30: Chapter 10: Recursion

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

Figure 10.21 Towers of Hanoi

Page 31: Chapter 10: Recursion

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

Figure 10.22 Towers of Hanoi After Steps 1 and 2

Page 32: Chapter 10: Recursion

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

Page 33: Chapter 10: Recursion

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

Figure 10.24 Recursive Function tower

Page 34: Chapter 10: Recursion

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

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

Page 35: Chapter 10: Recursion

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

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

Page 36: Chapter 10: Recursion

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

Figure 10.27 Grid with Three Blobs