Question: What is wrong with this simple recursive solution to get a Fibonacci sequence number? def Fib( n ): if n < 0: return 0 elif
What is wrong with this simple recursive solution to get a Fibonacci sequence number?
def Fib( n ):
if n < 0:
return 0
elif n <= 2:
return 1
else
return Fib( n - 1) + Fib( n - 2 )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
