A problem can be solved with recursion if
A) it can be broken down into any set of smaller problems
B) it can be broken down into at least three different subparts
C) it can be broken down into successive smaller problems that are identical to the overall problem
D) it can be solved by any method
E) None of these

Question

Quizplus · Accepted Answer

Recursion involves solving a problem by breaking it down into smaller instances of the same problem. Therefore, for a problem to be solved with recursion, it must be able to be broken down into successive smaller problems that are identical to the overall problem. Choice A is too broad because not all problems can be broken down into any set of smaller problems. Choice B is not specific enough, as it only requires that a problem can be broken down into at least three subparts, which may not necessarily be identical to the overall problem. Choice D is incorrect because not all problems can be solved by any method.

A Problem Can Be Solved with Recursion If