6.2-2

MIN-HEAPIFY(A, i)  l = LEFT(i)  r = RIGHT(i)  if l ≤ A.heap-size and A[l] < A[i]      smallest = l  else      smallest = i  if r ≤ A.heap-size and A[r] < A[i]      smallest = r  if smallest ≠ i      exchange A[i] with A[smallest]      MIN-HEAPIFY(A, smallest)

显然二者复杂度是一样的