You are given a function to compute factorial using recursion: pu

True / False Moderate

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);
}

How many recursive calls are made when calculating factorial(4)?

ID: #24836 Recursion in Java 15 views

Question Info

#24836Q ID

ModerateDifficulty

Recursion in JavaTopic

Start Quiz on This Topic

Your Answer

Choose the Best Option

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

Correct Answer

Answer: (c) 3

Continue Practice

Previous Question No Next

Challenge a friend or share with your study group.