Exam 14: Recursion

Given the following recursive function definition, what is the stopping case? Void towerschar source, char dest, char help, int numDisks) { IfnumDisks<1) { Return; } Else { Towerssource,help,dest,numDisks-1); Cout << "Move disk from " << source << " to " <<dest<<endl; Towershelp,dest,source,numDisks-1); } }

In the binary search program, each time through the list, we cut the list approximately

What is wrong with the following recursive function? It should print out the array backwards. Void printint array[], int start, int size) { Ifstart == size) Return; Else { Printarray, start-1,size); Cout << array[start] << endl; } }

For every recursive solution, there is an) ______________ solution.

Implementing a task recursively rather than iteratively generally

Only functions that do not return a value may be recursive.

What is the output of the following code fragment? int f1int base, int limit) { ifbase > limit) return -1; else ifbase == limit) return 1; else return base * f1base+2, limit); } int main) { cout << f12,4)<<endl; return 0; }

In order for the binary search to work correctly

The square of n can be calculated by noting that squaren) = squaren-1) + diffn-1). diffn) = diffn-1)+2. The square0)=0, diff0)=1. What is the stopping condition for this recursive definition?

Recursive functions must return a value.

There can be more than one stopping case in a recursive function.

What is the output of the following code fragment? Int f1int n, int m) { Ifn < m) Return 0; Else ifn==m) Return m+ f1n-1,m); Else Return n+ f1n-2,m-1); } Int main) { Cout << f15,4); Return 0; }

In a recursive power function that calculates some base to a positive exp power, at what value of exp do you stop? The function will continually multiply the base times the value returned by the power function with the base argument one smaller.

Recursive functions may return any type of value

What is wrong with the following recursive function? It should print out the array backwards. Void printint array[], int start, int size) { Ifstart == size) Return; Else { Printarray, start-1,size); Cout << array[start] << endl; } }

What is the output of the following code fragment? Int f1int x, int y) { Ifx<0 || y<0) Return x-y; Else Return f1x-1,y) + f1x,y-1); } Int main) { Cout << f11,2)<<endl; Return 0; }

A recursive function is a function that ______________.

A stack exhibits _________ behavior.

Given the following code fragment, what is the stopping conditions)? int f1int x, int y) { ifx<0 || y<0) return x-y; else return f1x-1,y) + f1x,y-1); } int main) { cout << f11,2)<<endl; return 0; }

What is the output of the following code fragment? Int f1int base, int limit) { Ifbase > limit) Return -1; Else Ifbase == limit) Return 1; Else Return base * f1base+1, limit); } Int main) { Cout << f112,4)<<endl; Return 0; }