Exam 20: Recursion

The programmer must ensure that a recursive function does not become

Select all that apply. Which of the following problems can be solved using recursion?

A problem can be solved with recursion if it can be broken down into successive smaller problems that are the same as the overall problem.

To solve a problem recursively, you must identify at least one case in which the problem can be solved without recursion.

When a recursive function directly calls itself, this is known as direct recursion.

The __________ of recursion is the number of times a recursive function calls itself.

When function A calls function B which, in turn, calls function A, this is known as