public class Test { 
  public static int[] Heap = { 10, 32, 1, 9, 5, 7, 12, 0, 4, 3 };
  // 預(yù)設(shè)數(shù)據(jù)數(shù)組 
  public static void main(String args[]) { 
    int i; // 循環(huán)計(jì)數(shù)變量 
    int Index = Heap.length; // 數(shù)據(jù)索引變量 
    System.out.print("排序前: "); 
    for (i = 1; i < Index - 1; i++) 
      System.out.printf("%3s", Heap); 
    System.out.println(""); 
    HeapSort(Index - 2); // 堆排序 
    System.out.print("排序后: "); 
    for (i = 1; i < Index - 1; i++) 
      System.out.printf("%3s", Heap); 
    System.out.println(""); 
  } 
  /** 
   * 建立堆 
   */ 
  public static void CreateHeap(int Root, int Index){
    int i, j; // 循環(huán)計(jì)數(shù)變量 
    int Temp; // 暫存變量 
    int Finish; // 判斷堆是否建立完成 
    j = 2 * Root; // 子節(jié)點(diǎn)的Index 
    Temp = Heap[Root]; // 暫存Heap的Root 值 
    Finish = 0; // 預(yù)設(shè)堆建立尚未完成 
    while (j <= Index && Finish == 0) { 
      if (j < Index) // 找最大的子節(jié)點(diǎn) 
        if (Heap[j] < Heap[j + 1]) 
          j++; 
      if (Temp >= Heap[j]) 
        Finish = 1; // 堆建立完成 
      else { 
        Heap[j / 2] = Heap[j]; // 父節(jié)點(diǎn) = 目前節(jié)點(diǎn)
        j = 2 * j; 
      } 
    } 
    Heap[j / 2] = Temp; // 父節(jié)點(diǎn) = Root值 
  } 
  public static void HeapSort(int Index) { 
    int i, j, Temp; 
    // 將二叉樹轉(zhuǎn)成Heap 
    for (i = (Index / 2); i >= 1; i--) 
      CreateHeap(i, Index); 
    // 開始進(jìn)行堆排序 
    for (i = Index - 1; i >= 1; i--) {   
      Temp = Heap; // Heap的Root值和最后一個(gè)值交換 
      Heap = Heap[1];   
      Heap[1] = Temp;   
      CreateHeap(1, i); // 對(duì)其余數(shù)值重建堆   
      System.out.print("排序中: ");   
      for (j = 1; j <= Index; j++)   
      System.out.printf("%3s",Heap[j]);   
      System.out.println("");   
    }
  }
}