Exam 19: Recursion

A ________ function is one that calls itself

The programmer must ensure that a recursive function does not become:

How many times will the following function call itself, if the value 5 is passed as the argument?

Any algorithm that can be coded with recursion can also be coded with an iterative structure.

The ________ algorithm uses recursion to efficiently sort a list.

A recursive function is designed to terminate when it reaches its ________.

Indirect recursion means that a function calls itself n number of times, then processing of the function starts from the first call.

Like a loop, a recursive function must have some method to control the number of times it repeats.

The QuickSort algorithm was developed in 1960 by ________.

When recursion is used on a linked list, it will always display the contents of the list in reverse order.

If a recursive function does not contain a base case, it ________.

The recursive factorial function calculates the factorial of its parameter. Its base case is when the parameter is ________.

A recursive function cannot call another function.

Recursive algorithms are less efficient than iterative algorithms.

Recursion can be used to:

The ________ of recursion is the number of times a recursive function calls itself.

The QuickSort algorithm is used to sort ________.

When a recursive function directly calls itself, this is known as direct recursion.

When function A calls function B, which in turn calls function A, this is known as:

The QuickSort algorithm works on the basis of