Recursive structures

The Process of breaking a large problem into smaller subproblems is called?

(a)  

The recursive function used to calculate the factorial of a number is written as factorial(n) = (a)   .

The (a)   is the simplest instance of a problem that stops the recursion.

A recursive function repeatedly calls (a)   until the base case is reached.

A recursive structure is defined in terms of itself.

• True

• False

Recursion can never cause a program to crash, even without a base case.

• True

• False

In recursion, a function must always have a base case to avoid infinite looping.

• True

• False

Tail recursion performs additional operations after the recursive call.

• True

• False

in the step to implement recursion the step 2 is the combination of the solution, true or false?

• True

• False

Which of the following is an example of a recursive algorithm?

• Bubble Sort

• Tower of Hanoi

• Insertion Sort

• Linear Search