MAX-HEAPIFY(A,i)
l = LEFT(I)
r = RIGHT(i)
if l<= A.heap-size and A[l]>A[i]
largest = l;
else largest = i;
if r<= A.heap-size and A[r]>A[largest]
largest = r
while(largest!=i)
exchange A[i] and A[largest]
i = largest
l = LEFT(I)
r = RIGHT(i)
if l<= A.heap-size and A[l]>A[i]
largest = l;
else largest = i;
if r<= A.heap-size and A[r]>A[largest]
largest = r
最大堆维护,MAX-HEAPIFY非递归伪代码
最新推荐文章于 2021-05-19 11:35:50 发布