The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What would be the recursive function call in a recursive implementation of this?
A) return;
B) return fibn) + fibn-1)
C) return fibn-1)+fibn-2)
D) return 1;

Question

Quizplus · Accepted Answer

The correct recursive function call for calculating a Fibonacci number is to call the function itself twice, once with the argument decreased by 1 and once with the argument decreased by 2, and then add those two results together, which matches option C: return fib(n-1) + fib(n-2).

The Recursive Definition of a Fibonacci Number Is Fn) =