How many recursive calls to the fib method shown below would be made from an original call to fib(4) ? (Do not count the original call)
Public int fib(int n)
{ // assumes n >= 0
If (n <= 1)
{
Return n
}
Else
{
Return (fib(n - 1) + fib(n - 2) ) ;
}
}

Question

How many recursive calls to the fib method shown below would be made from an original call to fib(4)? (Do not count the original call)
Public int fib(int n)
{ // assumes n >= 0
If (n <= 1)
{
Return n
}
Else
{
Return (fib(n - 1) + fib(n - 2));
}
}
A) 1
B) 2
C) 4
D) 8

Quizplus · Accepted Answer

The fib method makes two recursive calls for each n > 1. For fib(4), it calls fib(3) and fib(2). Each of these calls further makes additional recursive calls, resulting in a total of 8 recursive calls.

How Many Recursive Calls to the Fib Method Shown Below