The document discusses recursion, including: 1) Recursion is a programming technique where a method calls itself to solve a problem. It involves a base case and recursive calls. 2) Examples of recursive definitions and programs are given, such as computing factorials and sums recursively. 3) Recursion can be direct, where a method calls itself, or indirect through multiple method calls eventually leading back to the original method.

1. Chapter 10 Recursion

5. FIGURE 10.1 Tracing the recursive definition of a list

10. FIGURE 10.2 The sum of the numbers 1 through N, defined recursively

11. Recursive Programming public int sum (int num) { int result; if (num == 1) result = 1; else result = num + sum(num-1); return result; }

12. FIGURE 10.3 Recursive calls to the sum method

16. FIGURE 10.4 Indirect recursion

19. Listing 10.1

20. Listing 10.2

21. Listing 10.2 (cont.)

22. Listing 10.2 (cont.)

23. Listing 10.2 (cont.)

24. Listing 10.2 (cont.)

25. FIGURE 10.5 UML description of the Maze and MazeSearch classes

27. FIGURE 10.6 The Towers of Hanoi puzzle

28. FIGURE 10.7 A solution to the three-disk Towers of Hanoi puzzle

31. Listing 10.3

32. Listing 10.3 (cont.)

33. Listing 10.4

34. Listing 10.4 (cont.)

35. Listing 10.4 (cont.)

36. FIGURE 10.8 UML description of the SolveTowers and TowersofHanoi classes