fibonacci series with recursive approach

fibonacci.py

# recursive fibonacci series
# to mush overhead & duplicated calculation's
# let it gooo ! 


def fib(x):
    if x == 1 or x == 2 :
        return 1
    else:
        return fib(x-1) + fib(x - 2 )


def collect(n) :
    l = []
    for i in range(n):
        temp = fib(i) ;
        l.append(temp)
    return l

print(collect(5))