大根堆 - max heapify

def heapify(dList, root, boundary):
child = root * 2 + 1
large = root
if child <= boundary and dList[large] <= dList[child]:
large = child
if child+1 <= boundary and dList[large] <= dList[child+1]:
large = child + 1
if large != root:
dList[root], dList[large] = dList[large], dList[root]
heapify(dList, large, boundary)
return dList

def heapifyNOR(dList, root, boundary):
child = root * 2 + 1
large = root
while child <= boundary:
if dList[large] <= dList[child]:
large = child
if child+1 <= boundary and dList[large] <= dList[child+1]:
large = child + 1
if large == root:
break
dList[root], dList[large] = dList[large], dList[root]
root = large
child = root * 2 + 1
return dList

大根堆 -> 得到递增序列

小根堆 -> 得到递减序列