堆排序 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) 6 14 o 4 10 ⑨ 3 ④ ⑨ 3 ④ ⑦ ②④① ②①⑥i ②④⑥ (a) (b) (c) ⑧ 8 ⑦ 4 ④ ④ ② ① ⑨ ① ② 9 i⑩©6 ⑩④6 16 (d) (e)堆排序