Consider the recursive version of the fib method from the textbook shown below: public static long fib(int n)
{
If (n

Question

Consider the recursive version of the fib method from the textbook shown below: public static long fib(int n)
{
If (n <= 2)
{
Return 1;
}
Else
{
Return fib(n - 1) + fib(n - 2);
}
}
How many total recursive calls (not counting the original call) to fib will be made from the original call of fib(7)?
A) 12
B) 24
C) 30
D) 32

Quizplus · Accepted Answer

The recursive call tree for fib(7) results in 24 additional calls. Each call to fib(n) results in two more calls until the base case is reached.

Consider the Recursive Version of the Fib Method from the Textbook