Chapter $6($Recursion$)$

Knowledge Exercises

$2.$ True or false:

a$.$ All algorithms can be stated recursively.

b$.$ Some algorithms can only be stated recursively.

c$.$ For most people, recursive algorithms are more difficult to discover

and understand than nonrecursive algorithms.

d$.$ All recursive algorithms must have an escape clause.

$11.$ Give the base case, reduced problem, and general solution of the

recursive algorithm for:

a$.$ n $!$

b$.$ x$^$y

c$.$ The product of two integers a and b $.$

d$.$ The sum of the integers from a to b $,$ a $>$ b $.$

e$.$ Outputting an array of characters, c $,$ given the starting and ending

indices.

f$.$ Binary search of an array to locate the value aKey.