MAX-HEAPIFY(A, i)
while i ≤ A.heap-size
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[i]
largest = r
if largest ≠ i
exchange A[i] with A[largest]
i = largest
else
break
6.2-5
最新推荐文章于 2020-11-12 15:38:48 发布