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)
A)8
B)4
C)1

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)  
A)8 
B)4 
C)1

Quizplus · Accepted Answer

From an original call to fib(4), this method will make recursive calls to fib(3), fib(2), fib(2), and fib(1). Then, from the recursive call to fib(3), it will make recursive calls to fib(2), fib(1), and fib(1). Finally, from the recursive call to fib(2), it will make recursive calls to fib(1) and fib(0).

Therefore, a total of 8 recursive calls will be made from an original call to fib(4). So, the best choice is A.

How Many Recursive Calls to the Fib Method Shown Below