java 实现最小二叉树堆排序的实例

/**  * @description 元素添加到末尾，和它的父节点比，如果比它小就交换  * @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;//当前指向的数组元素位置     while(pointer!=0){       int leafPointer = pointer;//叶子节点位置       pointer = (pointer-1)/2;//根节点位置       root = minBinaryHeap[pointer];//根节点       if(num>=minBinaryHeap[pointer]){//永远把当前数组元素看成叶子与其根比较或者换位         break;       }//如果根比叶子大 就交换位置       minBinaryHeap[pointer] = num;       minBinaryHeap[leafPointer] = root;            }   }   return minBinaryHeap;    } 

/***  * 用随机数测试二叉堆排序  * 测试10遍，强迫症似的变态...  */ 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();   } }