def heap_sort(l: list):
min_heap = Heap.heapify(l)
res = []
while min_heap.size > 0:
res.append(min_heap.pop())
return res
def heap_sort(l: list):
min_heap = Heap.heapify(l)
res = []
while min_heap.size > 0:
res.append(min_heap.pop())
return res