# 第18章示例:递归求斐波那契

def fib(n):
    if n <= 0:
        return 0
    if n == 1:
        return 1
    return fib(n - 1) + fib(n - 2)

for i in range(10):
    print(fib(i), end=" ")
print()
# 0 1 1 2 3 5 8 13 21 34
