Lecture 17

Question 1

What is recursion

Answer 1

Recursion is the idea of solving a problem in terms of itself.

Question 2

The two main elements to recursive solutions are?

Answer 2

–The base case: the form (or forms) of the problem for which an exact solution is provided.
–The recursive step: the reduction of one version the problem to a simpler form.

Question 3

N factorial Code

Answer 3

int factorial(int n)
{
if(n == 0 || n == 1)
return 1;
else return n * factorial(n-1);
}

Question 4

how can the program keep track of its state?

Answer 4

Stacks

Question 5

Each individual method call within a recursive process can be called a

Answer 5

Frame

Question 6

Proof by induction involves three main parts:

Answer 6

A base case with a known solution.
A proposed, closed-form solution for any value , which the base case matches.
A proof that shows that if the proposed solution works for time step k, it works for time step k+1.