fibonacci,py

import sys
def fib(max):
    a = 0
    b = 1
    while a < max:
        print(a, end=" ")
        a, b = b, a+b
    print()


#
#  generating Fibonacci series using recursion
#  gen. function enclosed by external function
#
def fibre(max) -> list:

    lst = []
    def genfib(prev:int, act:int, n:int, l:list) -> list:
        if prev < n:
            l.append(prev)
            genfib(act, prev+act, n, l)
        return l

    return genfib(0,1, max,lst)

def fiboyield(N):
    a, b = 0, 1
    while a <= N:
        yield a
        a, b = b, a + b
    ...


def main(args):
    N = 108
    if len(args) > 1:
        N = int(args[1])
    for n in (fiboyield(N)):
        print(n, end=", ")
    print()


if __name__ == "__main__":
    sys.exit(main(sys.argv))