# 第18章示例:递归求阶乘

def factorial(n):
    if n <= 1:                 # 出口:0! 和 1! 都是 1
        return 1
    return n * factorial(n - 1)   # 递推:n! = n × (n-1)!

print(factorial(5))    # 120
print(factorial(6))    # 720

# 打印计算过程版本(理解递归轨迹)
def factorial_trace(n):
    if n <= 1:
        print(f"factorial({n}) = 1 (出口)")
        return 1
    print(f"factorial({n}) 等待 factorial({n-1})...")
    result = n * factorial_trace(n - 1)
    print(f"factorial({n}) 收到 {result}")
    return result

factorial_trace(4)
