Exam 12: Recursion

The majority of repetitive programming tasks are best done with _______________.

What is referred to as the base case?

In many cases a solution using recursion is more evident than a solution using a loop.

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

A function is called from the main function and then it calls itself five times. The depth of recursion is _______________.

Recursion is _____.

What defines the depth of recursion?

If the problem cannot be solved now, then a recursive function reduces it to a smaller but similar problem and _____.

When function A calls function B, which in turn calls function A, it is known as indirect recursion.

What is referred to as the recursive case?

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

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

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

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

A function is called from the main function for the first time. It then calls itself seven times. What is the depth of recursion?