Fibonacci without recursion

f.py

def fib(n, start_sequence=None):
    if not start_sequence:
        start_sequence = [0, 1]

    res = 0

    for i in range(0, n-1):  # -1 to as we count the start sequence as the first two numbers
        res = sum(start_sequence)
        start_sequence.pop(0)
        start_sequence.append(res)


    print(res)


assert fib(11) == 89