python堆排序

import heapq
import random
def heapsort(li):
    h = []
    for v in li:
        heapq.heappush(h,v)
    return [heapq.heappop(h) for i in range(len(h))]
if __name__ == '__main__':
    li = [1,2,3,4,5,6,7,8,9]
    random.shuffle(li)