Exam 15: Recursion

The recursive algorithm must have one or more base cases,and the general solution must eventually be reduced to a(n)____________________.

Infinite recursions execute forever on a computer.

In a recursive function,the base case stops the recursion.

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$$\quad$ return 10; $\quad$ else $\quad$$\quad$ return num * recFunc(num + 1); } -If every recursive call results in another recursive call,then the recursive function (algorithm)is said to have ____ recursion.

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$$\quad$ return 10; $\quad$ else $\quad$$\quad$ return num * recFunc(num + 1); } -A recursive function in which the last statement executed is the recursive call is called a(n)____ recursive function.

The following is an example of a recursive function,where nextNum is a function such that nextNum(x)= x + 1. int recFunc(int x) { return nextNum(nextNum(x)); }

The ____________________ bit of 33 is 1.

int puzzle(int start, int end) { if (start > end) $\quad$ return start - end; else if (start == end) $\quad$ return start + end; else $\quad$ return end * puzzle(start + 1, end - 1); } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << puzzle(3,7)<< endl;

Which of the following rules should you follow to solve the Tower of Hanoi problem?

Suppose that function A calls function B,function B calls function C,function C calls function D,and function D calls function A.Function A is then ____________________ recursive.