def Cycle_Sum(n):
sum = 0
num = 1
while num <= n:
sum = sum + num
num = num + 1
return sum
def Recursion_Sum(n):
if n == 1:
return 1;
return n + Recursion_Sum(n - 1)
print('循环求和：{}'.format(Cycle_Sum(100)))
print('递归求和：{}'.format(Recursion_Sum(100)))
def sub_sum(L):
oddSum = 0
evenSum = 0
index = 1
for num in L:
if index % 2:
oddSum = oddSum + num
else:
evenSum = evenSum + num
index = index + 1
return oddSum, evenSum
