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 more recursive calls to fib will be made from the original call of fib(7) than from the original call of fib(6) (not counting the original calls)?
A) 1
B) 2
C) 5
D) 10

Quizplus · Accepted Answer

The Answer of 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 more recursive calls to fib will be made from the original call of fib(7) than from the original call of fib(6) (not counting the original calls)?
A) 1
B) 2
C) 5
D) 10

Consider the Recursive Version of the Fib Method from the Textbook