摘要： 1 def heap_sort(ary): 2 n = len(ary) # 8 3 first = int(n / 2 - 1) # 3 4 for start in range(first, -1, -1): # 3~0 revese 5 max_... 阅读全文

摘要： 1 import sys 2 3 4 def fact(n): 5 final = n 6 while n > 1: 7 final *= n - 1 8 n -= 1 9 return final #逻辑严谨，不要忘了return10 ... 阅读全文