Recursive Algorithms

Which of the following is not essential in a recursive algorithm?

• Base Case

• Recursive Case

• Contains a stack

• Stop after a finite number of calls

The sub routine calls itself within the algorithm

• Base Case

• Recursive Case

The sub routine has a stopping condition that causes it to unwind

• Base Case

• Recursive Case

A recursive algorithm must always contain a base case

• True

• False

RuntimeError: maximum recursion depth exceeded

: what does this mean

• The program has crashed because it is taking too long

• The program has crashed because it has run out of memory

• The program has crashed because the user entered the wrong value

• The program has crashed because a variable had the wrong variable name

What is the base case?

• n

• n - 1

• n = n + calcSum (n-1)

• if n > 0

Which of the following is the best definition of a recursive method?

• A method that iterates itself exactly 5 times.

• A method that calls itself by name within the method.

• A method that will never iterate infinitely.

• A method that cannot be called more than once.

Recursion is much more efficient than iteration

• True

• False

Which of these data types is used by operating system to manage the Recursion

• Array

• Stack

• Queue

• Tree

Iteration is much more efficient than recursion

• True

• False