chapter 13

When module A calls module B, which calls module A, it is called _____ recursion.

indirect

Any problem that can be solved recursively can also be solved with a ______.

loop

The part of the problem that is solved without recursion is the ____ case.

base

When a recursive algorithm has reached the sub-problem it can directly solve, it has reached the ___ case.

base

Recursive functions work by ___.

breaking down complex problems into simpler subproblems of the same type

A recursive module _____.

calls itself

When a function calls itself 5 times, we call that the _____.

depth of the recursion

When a module explicitly calls itself it is called _______ recursion.

direct

A module is called once from a program's main() module, and then it calls itself four times. The depth of recursion is _______.

four

A recursive function that does not have a way of controlling the number of recursive calls is ____.

not useful

Actions taken by the computer when a module is called, such as allocating memory for parameters and local variables, are referred to as _____.

overhead

A function that calls itself is _____.

recursive

The part of the problem that is solved with recursion is the ____ case.

recursive

A recursive algorithm must _____ in the recursive case.

reduce the problem to a simpler problem

A recursive algorithm must ____ in the base case.

solve the problem without recursion