堆排序

最新推荐文章于 2023-09-21 13:21:58 发布

mambasmile

最新推荐文章于 2023-09-21 13:21:58 发布

阅读量118

点赞数

分类专栏： python学习基础算法

本文链接：https://blog.csdn.net/qq_26890109/article/details/81253836

版权

python学习同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

基础算法

7 篇文章 1 订阅

订阅专栏

"""调整节点，使得满足大顶堆"""
def Max_Heapify(heap,heapSize,root):
    left = root*2+1
    right = left+1
    large = root
    if left<heapSize and heap[left]<heap[large]:
        large=left
    if right<heapSize and heap[right]<heap[large]:
        large=right
    if large != root:
        heap[root],heap[large]=heap[large],heap[root]
        Max_Heapify(heap,heapSize,large)

"""由下至上建立大顶堆"""
def Build_Max_Heap(heap):
    HeapSize = heap.__len__()
    for i in xrange((HeapSize-2)/2,-1,-1):
        Max_Heapify(heap,HeapSize,i)


def HeapSort(nums):
    Build_Max_Heap(nums)
    for i in xrange(nums.__len__()-1,-1,-1):
        nums[0],nums[i]=nums[i],nums[0]
        Max_Heapify(nums,i,0)