堆排序

核心思想，curr_index和和curr_index*2+1和curr_index*2+2比大小，看是否需要交换（走那条路遍历），模拟二叉树，使得信息能够重复利用 

def heap_sort(a):
    def adjust_heap(start, end_index, a):
        parent, child = start, start * 2 + 1
        while (child < end_index):
            if child + 1 < end_index and a[child] < a[child + 1]:    child += 1
            if a[parent] > a[child]: break
            a[parent], a[child], parent, child = a[child], a[parent], child, child * 2 + 1

    for index in range(len(a) // 2, -1, -1):
        adjust_heap(index, len(a), a)

    for index in range(len(a) - 1, 0, -1):
        a[index], a[0] = a[0], a[index]
        adjust_heap(0, index, a)

if __name__ == '__main__':
    a = [1, 2, 7, 6, 4, 71, 9, 8, 77, 5, 44, 22, 123, 65]
    heap_sort(a)
    print(a)