Step 1: BASE CASE

def fib(n):
	if n<=2:
		return 1

Step 2: RECURSE

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

Step 3: TRY

def fib(n):
	if n<=2:
		return 1
	else:
		return fib(n-1)+fib(n-2)
for n in range(1,101):
	print(n,fib(n))

• Result

If you have seen the result, you might say: HEY, why did it stop?

Because it is slow. More of that later.