#Fibonacci Number with recursion

def fib(n):
    if n == 0:
	return 0
    elif n == 1:
	return 1
    else :
	return fib(n-1) + fib(n-2)
Published in: Python
Download

Related snippets