February 2014
Beginner
1248 pages
62h 25m
English
a) False. A method that calls itself in this manner is an example of indirect recursion.
b) False. Recursion can be inefficient in computation because of multiple method calls and memory-space usage.
c) True.
d) 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.
18.2 d
18.3 a
18.4 c
18.5 b
a) golden ratio, golden mean.
b) selection.
c) self-similar.
Read now
Unlock full access