Java™ How to Program, Seventh Edition

Answers to Self-Review Exercises

15.1	False. A method that calls itself indirectly is an example of recursion—more specifically, an example of indirect recursion. False. Recursion can be inefficient in computation because of multiple method calls and memory-space usage. True. False. To make recursion feasible, the recursion step in a recursive solution must resemble the original problem, but be a slightly smaller version of it.
15.2	d
15.3	a
15.4	c
15.5	b
15.6	golden ratio, golden mean. top. last-in, first-out (LIFO). activation record, stack frame. stack overflow. selection. self-similar. permutations. method-call.