Exam 13: Recursion

The base case is a case in which the problem can be solved without _____.

The base case does not require _______________, so it stops the chain of recursive calls.

Recursion is required to solve some type of problems.

A recursion in which a function directly calls itself is known as _______________ recursion.

A problem can be solved with recursion if it can be broken into smaller problems that are identical in structure to the overall problem.

A recursive function must have some way to control the number of times it repeats.

If the problem can be solved immediately without recursion, then the recursive function _____.

The process of calling a function requires _____.

A solution using a(n) _______________ is usually more evident than a recursive solution.

Some problems are _______________ solved with recursion than with a loop.

function A calls function B, which calls function C, which calls function A. This is called _____ recursion.

All the cases of the recursive solution other than the base case are called the _______________ case.

Recursion is _____.

What defines the depth of recursion?

What is the first step that needs to be taken in order to apply a recursive approach?