Recursion

Question 1

The terminating scenario or situation in recursive programming that does not use recursion to produce an answer.

Answer 1

Base Case

Question 2

A function that only makes a single recursive call to itself each time the function runs (as opposed to one that would call itself multiple times during execution). The factorial function is a good example of this.

Answer 2

Linear Recursion

Question 3

A recursive process that includes multiple recursive calls inside of a method, such as tree traversal methods that first traverse one branch of the tree from that node, and then the other branch.

Answer 3

Non-Linear Recursion

Question 4

A method where the solution to a problem depends on solution to smaller instances of the same problem.

Answer 4

Recursion

Question 5

One of two situation in a recursive method, the other being the base case, where another method call is made, moving closer and closer to the base case, which terminates the recursive process an unstacks all previously called methods.

Answer 5

Recursive Case