I'm assuming this means: return an improvement of the terrible recursive version. here it is in python: def fib(n): n -=1 #for the user who calls it assuming 1-indexing i, a, b = 0, 0, 1 while i < n: a, b = b, a+b i+=1 return a