python堆排序

import heapqdef heapsort(items):    heap = []    for item in items:        heapq.heappush(heap, item)    return [heapq.heappop(heap) for _ in range(len(heap))]nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]print(heapsort(nums))