1. © 2012 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 9: Recursion Problem Solving & Program Design in C Seventh Edition By Jeri R. Hanly & Elliot B. Koffman

2. 1-2 © 2012 Pearson Addison-Wesley. All rights reserved. 1-2 Figure 9.1 Splitting a Problem into Smaller Problems

3. 1-3 © 2012 Pearson Addison-Wesley. All rights reserved. 1-3 Figure 9.2 Recursive Function multiply

4. 1-4 © 2012 Pearson Addison-Wesley. All rights reserved. 1-4 Figure 9.3 Thought Process of Recursive Algorithm Developer

5. 1-5 © 2012 Pearson Addison-Wesley. All rights reserved. 1-5 Figure 9.4 Counting Occurrences of a Character in a String

6. 1-6 © 2012 Pearson Addison-Wesley. All rights reserved. 1-6 Figure 9.4 Counting Occurrences of a Character in a String (cont’d)

7. 1-7 © 2012 Pearson Addison-Wesley. All rights reserved. 1-7 Figure 9.5 Trace of Function multiply

8. 1-8 © 2012 Pearson Addison-Wesley. All rights reserved. 1-8 Figure 9.6 Function reverse_input_words

9. 1-9 © 2012 Pearson Addison-Wesley. All rights reserved. 1-9 Figure 9.7 Trace of reverse_input_words(3) When the Words Entered are "bits" "and" "bytes"

10. 1-10 © 2012 Pearson Addison-Wesley. All rights reserved. 1-10 Figure 9.8 Sequence of Events for Trace of reverse_input_words(3)

11. 1-11 © 2012 Pearson Addison-Wesley. All rights reserved. 1-11 Figure 9.9 Recursive Function multiply with Print Statements to Create Trace and Output from multiply(8, 3)

12. 1-12 © 2012 Pearson Addison-Wesley. All rights reserved. 1-12 Figure 9.10 Recursive factorial Function

13. 1-13 © 2012 Pearson Addison-Wesley. All rights reserved. 1-13 Figure 9.11 Trace of fact = factorial(3);

14. 1-14 © 2012 Pearson Addison-Wesley. All rights reserved. 1-14 Figure 9.12 Iterative Function factorial

15. 1-15 © 2012 Pearson Addison-Wesley. All rights reserved. 1-15 Figure 9.13 Recursive Function fibonacci

16. 1-16 © 2012 Pearson Addison-Wesley. All rights reserved. 1-16 Figure 9.14 Program Using Recursive Function gcd

17. 1-17 © 2012 Pearson Addison-Wesley. All rights reserved. 1-17 Figure 9.15 Recursive Function to Extract Capital Letters from a String

18. 1-18 © 2012 Pearson Addison-Wesley. All rights reserved. 1-18 Figure 9.16 Trace of Call to Recursive Function find_caps

19. 1-19 © 2012 Pearson Addison-Wesley. All rights reserved. 1-19 Figure 9.17 Sequence of Events for Trace of Call to find_caps from printf Statements

20. 1-20 © 2012 Pearson Addison-Wesley. All rights reserved. 1-20 Figure 9.18 Trace of Selection Sort

21. 1-21 © 2012 Pearson Addison-Wesley. All rights reserved. 1-21 Figure 9.19 Recursive Selection Sort

22. 1-22 © 2012 Pearson Addison-Wesley. All rights reserved. 1-22 Figure 9.19 Recursive Selection Sort (cont’d)

23. 1-23 © 2012 Pearson Addison-Wesley. All rights reserved. 1-23 Figure 9.20 Recursive Set Operations on Sets Represented as Character Strings

24. 1-24 © 2012 Pearson Addison-Wesley. All rights reserved. 1-24 Figure 9.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

25. 1-25 © 2012 Pearson Addison-Wesley. All rights reserved. 1-25 Figure 9.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

26. 1-26 © 2012 Pearson Addison-Wesley. All rights reserved. 1-26 Figure 9.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

27. 1-27 © 2012 Pearson Addison-Wesley. All rights reserved. 1-27 Figure 9.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

28. 1-28 © 2012 Pearson Addison-Wesley. All rights reserved. 1-28 Figure 9.20 Recursive Set Operations on Sets Represented as Character Strings (cont’d)

29. 1-29 © 2012 Pearson Addison-Wesley. All rights reserved. 1-29 Figure 9.21 Towers of Hanoi

30. 1-30 © 2012 Pearson Addison-Wesley. All rights reserved. 1-30 Figure 9.22 Towers of Hanoi After Steps 1 and 2

31. 1-31 © 2012 Pearson Addison-Wesley. All rights reserved. 1-31 Figure 9.23 Towers of Hanoi After Steps 1, 2, 3.1, and 3.2

32. 1-32 © 2012 Pearson Addison-Wesley. All rights reserved. 1-32 Figure 9.24 Recursive Function tower

33. 1-33 © 2012 Pearson Addison-Wesley. All rights reserved. 1-33 Figure 9.25 Trace of tower ('A', 'C', 'B', 3);

34. 1-34 © 2012 Pearson Addison-Wesley. All rights reserved. 1-34 Figure 9.26 Output Generated by tower ('A', 'C', 'B', 3);

35. 1-35 © 2012 Pearson Addison-Wesley. All rights reserved. 1-35 Figure 9.27 Grid with Three Blobs