Question

What is the output of the following recursive function call func(3) ? int func ( int
n) { if (n == 0 ) return 1 ; return n * func(n - 1 ); }

Q: Answer-What is the output of the following recursive function call func(3) ? int func ( int n) { ...

This function computes the factorial of n . Factorial is defined as nnn1 1 . For n3 func3 calls 3 func2 . func2 calls 2 func1 . func1 calls 1 func0 . func0 returns 1 base case. The calculation is 3216 Why Other Options Are Incorrect Option A 1 Only the base case returns 1 . This does not account for recursive multiplication. Option B 3 This is the input but not the factorial result. Option D 9 This result might confuse with 3 , which is unrelated to factorial. Option E 27 This is 33 .