The part (or statement) of a recursive function that decides whether the recursive loop is terminated is called: (Select all that apply)
Answer:
The base case
Explanation:
Required
The part that determines the termination of a recursion
This part of a recursion is referred to as the base case.
Take for instance, the following:
factorial(int n) {
if (n < = 1) { return 1; }
else { return n*factorial(n-1); } }
The base case of the above is if (n < = 1) { return 1; }
Because the recursion will continue to be executed until the condition is true i.e. n less than or equals 1
