heapsort in PriorityQueue

先上圖：java size = 8api Pi = (Ci+1)/2-1數組 CLi  = 2Pi+1數據結構 CRi = CLi+1spa 備註：Pi爲父節點index3d            Ci爲子節點indexcode           CLi爲左子節點indexblog           CRi爲右子節點indexelement PriorityQueue中的數據結構爲：rem O

>>阅读原文<<