def heap_sort(iterable):
    import heapq as hq
    
    h = []
    for value in iterable:
        hq.heappush(h, value)
    return [hq.heappop(h) for i in range(len(h))]
def heap_sort(iterable):
    import heapq as hq
    h = []
   
    _value_i = 0
    while _value_i < len(iterable):
        value = iterable[_value_i]
        hq.heappush(h, value)
        _value_i += 1
    return [hq.heappop(h) for i in range(len(h))]