Java How to Program, Early Objects, 11th Edition

Self-Review Exercises

1. 18.1 State whether each of the following is true or false. If false, explain why.

   1. A method that calls itself indirectly is not an example of recursion.

   2. Recursion can be efficient in computation because of reduced memory-space usage.

   3. When a recursive method is called to solve a problem, it actually is capable of solving only the simplest case(s), or base case(s).

   4. To make recursion feasible, the recursion step in a recursive solution must resemble the original problem, but be a slightly larger version of it.

2. 18.2 A                  is needed to terminate recursion.

   1. recursion step

   2. break statement

   3. void return type

   4. base case

3. 18.3 The first call to invoke a recursive method is                 .

   1. not recursive ...