Exam 12: Recursion

Some problems are more __________ solved with recursion than with a loop.

Recursive algorithms are always more concise and efficient than iterative algorithms.

Each time a function is called,the system incurs __________ that is not necessary with a loop.

A function is called from the main function and then it calls itself five times. The depth of recursion is __________.

In a recursive solution,if the problem cannot be solved now,then a recursive function reduces it to a smaller but similar problem and

The majority of repetitive programming tasks are best done with ___________.

If,in a recursive solution,function A calls function B which calls function C,this is called __________ recursion.

Recursive functions are __________ iterative algorithms.

The process of calling a function requires

A solution using a(n)__________ is usually more evident than a recursive solution.

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

All the cases of a recursive solution other than the base case are called the __________ case.

Each time a function is called in a recursive solution,the system incurs overhead that is not incurred with a loop.

If a problem can be solved immediately without recursion,then the recursive function

If a recursive solution is evident for a particular problem,and if the recursive algorithm does not slow system performance by an intolerable amount,then recursion would probably be a good design choice.

A recursive function includes __________ which are not necessary in a loop structure.

A function is called from the main function for the first time and then calls itself seven times. What is the depth of recursion?

A problem can be solved with recursion if it can be broken down into __________ problems.

A recursive function must have some way to control the number of times it repeats.

A problem can normally be solved with recursion if it can be broken down into smaller problems that are identical in structure to the overall problem.