In the following code that uses recursion to find the factorial of a number, what is the base case? private static int factorial(int n)
{
If (n == 0)
Return 1;
Else
Return n * factorial(n - 1);
}
A) factorial(int n)
B) if (n == 0)
Return 1;
C) else
Return n * factorial(n - 1);
D) Cannot tell from this code

Question

Quizplus · Accepted Answer

The base case in a recursive function is the condition under which the function stops calling itself and returns a value without any further recursion. In this code, the base case is when `n == 0`, at which point the function returns 1, effectively stopping further recursive calls.

In the Following Code That Uses Recursion to Find the Factorial