最小二叉樹堆排序怎么利用java 實現(xiàn)

/** 
 * @description 元素添加到末尾，和它的父節(jié)點比，如果比它小就交換 
 * @param array 
 * 
 * @author LynnWong 
 */ 
private int[] getMinBinaryHeap(int[] array){ 
  int N = array.length; 
  int minBinaryHeap[] = new int[N]; 
  int root;//根的值 
  int heapSize = 0;//記錄插入位置 
  for(int num : array){ 
    minBinaryHeap[heapSize]=num; 
    ++heapSize; 
    int pointer = heapSize-1;//當前指向的數(shù)組元素位置 
    while(pointer!=0){ 
      int leafPointer = pointer;//葉子節(jié)點位置 
      pointer = (pointer-1)/2;//根節(jié)點位置 
      root = minBinaryHeap[pointer];//根節(jié)點 
      if(num>=minBinaryHeap[pointer]){//永遠把當前數(shù)組元素看成葉子與其根比較或者換位 
        break; 
      }//如果根比葉子大 就交換位置 
      minBinaryHeap[pointer] = num; 
      minBinaryHeap[leafPointer] = root; 
       
    } 
  } 
  return minBinaryHeap; 
   
} 

/*** 
 * 用隨機數(shù)測試二叉堆排序 
 * 測試10遍，強迫癥似的變態(tài)... 
 */ 
public void text(){ 
  for(int i=0;i<10;i++){ 
    Random rnd = new Random();  
    int [] lala = {rnd.nextInt(6),rnd.nextInt(6),rnd.nextInt(6),rnd.nextInt(6),rnd.nextInt(6),rnd.nextInt(6)}; 
    System.out.print("輸入："); 
    for(int a : lala){ 
      System.out.print(a+" "); 
    } 
    System.out.println(); 
    int []array = this.getMinBinaryHeap(lala); 
    System.out.print("輸出："); 
    for(int a : array){ 
      System.out.print(a+" "); 
    } 
    System.out.println(); 
  } 
}