recursive C++

chapter 14 of Savitch textbk

13 cards·by bubblesort1

c++

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

True

You may have at most 1 recursive call in a recursive function.

False

Recursive functions must return a value.

False

The operating system uses a stack to control recursion.

True

A class member function may be recursive.

True

Recursive functions may return any type of value.

True

Not all recursive definitions may be written iteratively.

False

Recursive functions always execute faster than an iterative function.

False

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

False

Every recursive definition may be rewritten iteratively.

True

A recursive function is a function that______.

calls itself

A stack exhibits what behavior?

Last in, first out

How do you ensure that your function does not have infinite recursion?

All recursive calls lead to a stopping case.