Exam 7: Iterators

Each recursive call to a method uses the same local variables and parameters.

Any recursive definition must have a ______ part, called the base case, which permits the recursion to eventually end.

The order of a recursive algorithm can be determined using techniques similar to analyzing ______ processing.

When is a base case needed for recursive processing?

Recursion is a programming technique in which a method calls ______.

The Towers of Hanoi solution has quadratic complexity, which is very inefficient. Yet the implementation of the solution is incredibly short and elegant.

Explain the general approach to solving the Towers of Hanoi puzzle. How does it relate to recursion?

The order of a recursive algorithm can be determined using techniques similar to analyzing ______ processing.

What is indirect recursion?

One of the reasons recursion is so elegant and effective is that it creates a new set of local variables and parameters with each call.

____________ problems and formulas are often expressed recursively.

The Towers of Hanoi solution has ___________ complexity, which is very inefficient. Yet the implementation of the solution is incredibly short and elegant.