Java™ How to Program, Seventh Edition

Self-Review Exercises

15.1	State whether each of the following is true or false. If false, explain why. A method that calls itself indirectly is not an example of recursion. Recursion can be efficient in computation because of reduced memory-space usage. 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). To make recursion feasible, the recursion step in a recursive solution must resemble the original problem, but be a slightly larger version of it.
15.2	A __________ is needed to terminate recursion. recursion step break statement void return type base case
15.3	The first call to invoke a recursive method is__________. not recursive recursive the recursion step none of the above ...