递归实现斐波那契

def fun(i):

    if i == 0:

        return 0

    elif i == 1:

        return 1

    else:

        return fun(i-2) + fei(i-1)

if __name__ == '__main__':

    for i in range(10):

        print(fun(i),end=" ")