Exam 12: Recursion

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

Which would be the base case in a recursive solution to the problem of finding the factorial of a number. Recall that the factorial of a non-negative whole number is defined as n! where: If n = 0,then n! = 1 If n > 0,then n! = 1 x 2 x 3 x ... X n

When,in a recursive solution,function A calls function B which,in turn,calls function A,this is known as indirect recursion.

Recursion is

Recursive function calls are __________ efficient than loops.

What defines the depth of recursion?

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

Which of the following describes the base case in a recursive solution?

A base case is not necessary for all recursive algorithms.

What is the first step to take in order to apply a recursive approach?

There must be only one function involved in any recursive solution.

Recursion is sometimes required to solve certain types of problems.

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

In many cases it is easier to see how to solve a problem with recursion than with a loop.

Usually a problem solved by recursion is reduced by making the value of one or more parameters __________ with each recursive call.