recursive algorithms

Question 1

recursive case

Answer 1

where we use the same algorithm to solve a simpler version of the problem. This is where the method calls itself with the same number of parameters to solve a smaller version of the problem.

Question 2

base case

Answer 2

the solution to the “simplest” possible problem. The base case does not require calling itself or any recursive case.

Question 3

forward phase

Answer 3

phase of recursion where a call to the function spins off another function call (think about it as a clone of itself), and that spins off another call and so on until the base case is reached.