One of fastest way for Fibonacci series

fibonacci_series_dynamic_with_array.py

r = 1000
m = []
def fibo(n):
	if len(m) == 0:
		m[:r] = [0] * r;
	if n == 1 or n == 2:
		m[n] = n
		return n
	else:
		a1 = m[n - 1]
		a2 = m[n - 2]
		if m[n - 1] == 0:
			a1 = fibo(n - 1)
			m[n - 1] = a1
		if m[n - 2] == 0:
			a2 = fibo(n - 2)
			m[n - 2] = a2
		return a1 + a2


for i in range(1,r):
	print(fibo(i));

fibonacci_series_dynamic_with_object.py

r = 1000
m = {}
def fibo(n):
	if n == 1 or n == 2:
		m[str(n)] = n
		return n
	else:
		if str(n - 1) in m:
			a1 = m[str(n - 1)]
		else:
			a1 = fibo(n - 1)
			m[str(n - 1)] = a1
		if (str(n - 2) in m):
			a2 = m[str(n - 2)]
		else:
			a2 = fibo(n - 2)
			m[str(n - 2)] = a2
		return a1 + a2
		
for i in range(1,r):
	print(fibo(i));