Python 实现堆排序

最新推荐文章于 2024-10-07 01:36:35 发布

豆逗1990

最新推荐文章于 2024-10-07 01:36:35 发布

阅读量356

点赞数

分类专栏：随笔文章标签： python heap 堆排序

本文链接：https://blog.csdn.net/daodaojiejacket/article/details/54564257

版权

随笔专栏收录该内容

5 篇文章 0 订阅

订阅专栏

def heapadjust(seq, node, size): #adjust heap
    lchild = 2 * node + 1
    rchild = 2 * node + 2
    maxcode = node
    if node <= size / 2 - 1: #if lefthchild or rightchild > root node, exchange the value
        if lchild <= size - 1 and seq[lchild] > seq[maxcode]:
            maxcode = lchild
        if rchild <= size - 1 and seq[rchild] > seq[maxcode]:
            maxcode = rchild
        if maxcode != node:
            tem = seq[node]
            seq[node] = seq[maxcode]
            seq[maxcode] = tem
            heapadjust(seq, maxcode, size) #adjust the heap which root is maxcode

def buildheap(seq, size): #build heap
    for i in range(size / 2 - 1, -1, -1):
        heapadjust(seq, i, size)

def heapsort(seq, size): # we can get the maximum value in each loop and put it at the end of array
    buildheap(seq, size)
    for j in range(size - 1, -1, -1):
        tem = seq[0]
        seq[0] = seq[j]
        seq[j] = tem
        buildheap(seq, j)
    return seq


if __name__ == '__main__':
    l = [0, 16, 20, 3, 11, 17, 8]
    print heapsort(l, len(l))