import heapq

def heap_sort(values):
    pending = list(values)
    heapq.heapify(pending)
    return [heapq.heappop(pending) for _ in range(len(pending))]

print(heap_sort([14, 5, 11, 5, 2]))
print(heap_sort([]))