Question: How many recursive calls does this method have and how can you tell? Fib(n): IF n equal 0 Return 0 ELSE IF n equal 1
How many recursive calls does this method have and how can you tell?
Fib(n):
IF n equal 0
Return 0
ELSE IF n equal 1
Return 1
ElseReturn Fib(n-1) + Fib(n-2)
Step by Step Solution
3.32 Rating (158 Votes )
There are 3 Steps involved in it
Fibn IF n equal 0 Return 0 ELSE IF n equal 1 Return 1 ElseReturn ... View full answer
Get step-by-step solutions from verified subject matter experts
