QYou are given a function to compute factorial using recursion:

public int factorial(int n) {
    if (n == 0) {
        return 1;
    }
    return n * factorial(n - 1);
}

What is the base case in the function?

Choose the Best Option

Click any option to instantly check if you're correct.

• A n == 0 ✔ ✖
• B int n ✔ ✖
• C return 1 ✔ ✖
• D return n * factorial(n - 1) ✔ ✖

Share This Question

Challenge a friend or share with your study group.

Related MCQ Questions