堆排序

如何用代码表示一个堆：

如何用数组存储一个堆：
[0,1,2,3,4,5,6,7,8,9,10]
父节点：
parent = (i-1)/2
两个子节点：
c1 = 2i+1
c2 = 2i+2

'''
parent = (i-1)/2
c1 = 2i+1
c2 = 2i+2
'''
def swap(arr, i, j):
    temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp
def heapify(tree, n, i):#调整操作
    if i >= n:
        return
    c1 = 2 * i + 1
    c2 = 2 * i + 2
    max = i
    if c1 < n and tree[c1] > tree[max]:
        max = c1
    if c2 < n and tree[c2] > tree[max]:
        max = c2
    if max != i:
        swap(tree, max, i)
        heapify(tree, n, max)
def build_heap(tree, n):#自下往上调整
    last_node = n-1
    parent = int((last_node-1)/2)
    for i in range(parent,-1,-1):
        heapify(tree, n, i)
def heap_sort(tree, n):
    build_heap(tree, n)
    for i in range(n-1, -1, -1):
        swap(tree, i, 0)
        heapify(tree, i, 0)
#tree = [4, 10, 3, 5, 1, 2]
tree = [2, 5, 3, 1, 10, 4]
n = 6
#build_heap(tree, n)
heap_sort(tree, n)
print(tree)

复杂度分析：