## 正常方法：循环,一个个叠加
def sum_cycle(n): 
    sum = 0 
    for i in range(1,n+1) : 
        sum = sum + i
    return sum
## 递归方式：前n个数的和，即前n-1个数的和+n
def sum_recu(n): 
    if n>0: 
       return n +sum_recu(n-1) 
    else: 
       return 0 
print(sum_cycle(100))
print(sum_recu(100)) # 高斯的同学们看了都会流泪
print(sum_recu(10000))

--------------------------------------------------------------------------- RecursionError Traceback (most recent ca