python递归fibonacci

def proc(n):
    print('n=',n) #这一行被注释，输出结果大不同
    if n < 0:
        print('-', end = '\n')
        n = -n
    if n // 10:
        proc(n // 10 )
    print(n % 10, end = '')

proc(-684)
#-----------------
#fibonacci
def fib(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fib(n-1) + fib(n-2)  #递归
for i in range(100):
    print(fib(i))