from heapq import * def heasort(initi):# 排序 h=[] for value in initi: heappush(h,value)#将每一个item进入heap中 return [heappop(h) for i in range(len(h))] def merge_sort(seq):#堆排序 if len(seq) <= 1:#如果seq的list长度小于1 直接返回 return seq else: middle = int(len(seq)/2…