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(6)?
A) 6
B) 12
C) 14
D) 20

Quizplus · Accepted Answer

The recursive calls for fib(6) are: fib(5) and fib(4). fib(5) calls fib(4) and fib(3), fib(4) calls fib(3) and fib(2), fib(3) calls fib(2) and fib(1). Counting all these calls, we get a total of 14 recursive calls.

Consider the Recursive Version of the Fib Method from the Textbook