本文提供了一个使用Python实现的堆排序算法实例。通过调整元素位置确保父节点总是大于或等于其子节点，从而形成最大堆。之后通过不断交换堆顶元素与最后一个元素并重新调整堆，最终实现数组的有序排列。
def adjust(a, root, n):
k = a[root-1]
c = root * 2
while c <= n:
if c + 1 <= n and a[c] > a[c-1]:
c += 1
if a[c-1] <= k:
break
a[c/2-1] = a[c-1]
c *= 2
a[c/2-1] = k
def heapSort(a):
n = len(a)
for i in xrange(n / 2, 0, -1):
adjust(a, i, n)
for i in xrange(n - 1, 0, -1):
a[0], a[i] = a[i], a[0]
adjust(a, 1, i)
if __name__ == '__main__':
from random import shuffle
data = range(100)
shuffle(data)
print data
heapSort(data)
k = a[root-1]
c = root * 2
while c <= n:
if c + 1 <= n and a[c] > a[c-1]:
c += 1
if a[c-1] <= k:
break
a[c/2-1] = a[c-1]
c *= 2
a[c/2-1] = k
def heapSort(a):
n = len(a)
for i in xrange(n / 2, 0, -1):
adjust(a, i, n)
for i in xrange(n - 1, 0, -1):
a[0], a[i] = a[i], a[0]
adjust(a, 1, i)
if __name__ == '__main__':
from random import shuffle
data = range(100)
shuffle(data)
print data
heapSort(data)
print data
扫一扫
979
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
