调整堆的算法

iteye_15479

于 2010-09-25 10:34:35 发布

阅读量315

点赞数

分类专栏： c++ 文章标签：算法

本文链接：https://blog.csdn.net/iteye_15479/article/details/81930357

版权

c++ 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

Begin
adjustHeap(A[], i) // Heapify takes in our heap and index of current root node of subtree to be heapified
{
left=leftChild();
right=rightChild();
largest=i;
if left<=A.heap-size AND A[left]>A[i] {
largest=left;
}
if right<=A.heap-size AND A[right]>A[i] {
largest=right;
}

if largest NOT EQUAL i {
swap A[i] and A[largest]
adjustHeap[A, largest)
}
END