Naive implementation to get the nth element of the Fibonacci sequence

fibonacci-1.py

""" Naive implementation to get the nth element of the  Fibonacci sequence """

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

fibonacci-3.py

def memoize(f):
	cache = {}
	def aux(*args, **kargs):
		k = (args, tuple(kargs.items()))
		if k not in cache:
			cache[k] = f(*args, **kargs)
		return cache[k]
	return aux

@memoize
def fib(n):
	if n == 0:
		return 0
	elif n == 1:
		return 1
	else:
		return fib(n-1) + fib(n-2)