save project

diy2.py

-alist = [88, 75, 72, 82, 90, 85, 78, 91]
+def sum_numbers(num):
+      # 递归的出口
+      if num == 1:
+           return 1
+
+      #  数字的累加
+      temp = sum_numbers(num - 1)
+      return num +temp
+result = sum_numbers(100)
+print(result) 
 
 
-n = len(alist)
-# i表示第几轮排序
-for i in range(0, n-1):
-    for j in range(0, n-1):   # j表示列表的索引下标
-        # 比较大小并交换
-        if alist[j] < alist[j + 1]:
-            alist[j], alist[j + 1] = alist[j + 1], alist[j]
-    print(alist)