堆排序 HEAPSORT(A) 1 BUILD-MAX-HEAP(A) 2 for i A.length downto 2 3 exchange A[1]with A[i] 4 A.heap-size A.heap-size-1 5 MAX-HEAPIFY(A.1) 0 4 0 ⑧ 8 ① 4 ⑦⑨ ③ ④ ① ②④① ②①⑥i (a) (b) (c) ⑨ ⑧ 8 ④ ④ ② ① ⑨ ① ② ⑧ ⑩6 6 (d) (e)堆排序