public static int exampleRecursion (int n)
{
If (n == 0)
Return 0;
Else
Return exampleRecursion(n - 1) + n * n * n;
}What is the output of exampleRecursion(3)?
A) 25
B) 32
C) 36
D) 42

Question

Quizplus · Accepted Answer

When we call exampleRecursion(3), n is not equal to 0 so the else statement is executed. 
exampleRescurion(2) is called and again, n is not 0 so we continue down to exampleRecursion(1).
Once again, n is not 0 so we call exampleRecursion(0).
Now that n equals 0, we return 0 to exampleRecursion(1).

exampleRecursion(1) adds 1^3 to the return value of exampleRecursion(0) resulting in 1.
exampleRecursion(2) adds 2^3 to the return value of exampleRecursion(1) resulting in 9. 
exampleRecursion(3) adds 3^3 to the return value of exampleRecursion(2) resulting in 36.

Therefore, the output of exampleRecursion(3) is 36.

Public Static Int ExampleRecursion (Int N)