堆排序--只是应对互联网面试

堆排序
def MAX_Heapify(heap,HeapSize,root):
left=2root+1
right=2root+2
larger=root
if left<HeapSize and heap[larger]<heap[left]:
larger=left
if right<HeapSize and heap[larger]<heap[right]:
larger=right
if larger!=root:
heap[larger],heap[root]=heap[root],heap[larger]
MAX_Heapify(heap,HeapSize,larger)
def Build_MAX_Heap(heap):
HeapSize=len(heap)
for i in range((HeapSize-2)//2,-1,-1):
MAX_Heapify(heap,HeapSize,i)

def HeapSort(heap):
Build_MAX_Heap(heap)
for i in range(len(heap)-1,-1,-1):
heap[0],heap[i]=heap[i],heap[0]
MAX_Heapify(heap,i,0)
return heap

a=[1,3,2,7,5,4,6,9,8]
print(HeapSort(a))