Which of the following code snippets returns the factorial of a given number? (Hint: Factorial of 5 = 5! = 1 * 2 * 3 * 4 * 5 = 120)
A) public static int factorial(int num)
{
Return num * factorial(num - 1);
}
B) public static int factorial(int num)
{
If (num == 1)
{
Return 1;
}
Return num * factorial(num);
}
C) public static int factorial(int num)
{
If (num == 1)
{
Return 1;
}
System.out.println(num * factorial(num - 1));
}
D) public static int factorial(int num)
{
If (num == 1)
{
Return 1;
}
Return num * factorial(num - 1);
}

Question

Quizplus · Accepted Answer

The correct implementation of factorial calculation is recursive in nature. It first checks if the given number is equal to 1, then returns 1 as the base case. For all other cases, it calls the factorial function recursively with the argument (num-1) and multiplies the result with the original number. Option D follows this logic and returns the correct result.

Which of the Following Code Snippets Returns the Factorial of a Given