You are viewing a single comment's thread. Return to all comments →
Most Basic Python Soln
def fibonacci(n):
if(n==0): return 0 elif(n==1): return 1 else: return fibonacci(n-1)+fibonacci(n-2)
n = int(input()) print(fibonacci(n))
Seems like cookies are disabled on this browser, please enable them to open this website
Recursion: Fibonacci Numbers
You are viewing a single comment's thread. Return to all comments →
Most Basic Python Soln
def fibonacci(n):
n = int(input()) print(fibonacci(n))