Exam 12: Recursion

Recursive function calls are _______________ efficient than loops.

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 problem can be solved with recursion if it can be broken down into _____ problems.

The process of calling a function requires _____.

If a recursive solution is evident for a particular problem, and the recursive algorithm does not slow system performance by an intolerable amount, then recursion would be a good design choice.

Each time a function is called, the system incurs overhead that is not necessary with a loop.

A base case is not necessary for all recursive algorithms.

There can be several functions involved in the recursion.

A recursive function includes _____ which are not necessary in a loop structure.

Recursive functions are _____ iterative algorithms.

Recursion is required to solve some type of problems.

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

Usually, a problem is reduced by making the value of one or more parameters _______________ with each recursive call.

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

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

Each time a function is called, the system incurs _______________ that is not necessary with a loop.

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

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

Recursive algorithms are more concise and efficient than iterative algorithms.

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