public  void heapSort(int[] a){System.out.println("开始排序");int arrayLength=a.length;//循环建堆  for(int i=0;i<arrayLength-1;i++){//建堆
buildMaxHeap(a,arrayLength-1-i);//交换堆顶和最后一个元素  swap(a,0,arrayLength-1-i);System.out.println(Arrays.toString(a));}}private  void swap(int[] data, int i, int j) {// TODO Auto-generated method stub  int tmp=data[i];data[i]=data[j];data[j]=tmp;}//对data数组从0到lastIndex建大顶堆  private void buildMaxHeap(int[] data, int lastIndex) {// TODO Auto-generated method stub  //从lastIndex处节点（最后一个节点）的父节点开始  for(int i=(lastIndex-1)/2;i>=0;i--){//k保存正在判断的节点  int k=i;//如果当前k节点的子节点存在  while(k*2+1<=lastIndex){//k节点的左子节点的索引  int biggerIndex=2*k+1;//如果biggerIndex小于lastIndex，即biggerIndex+1代表的k节点的右子节点存在  if(biggerIndex<lastIndex){//若果右子节点的值较大  if(data[biggerIndex]<data[biggerIndex+1]){//biggerIndex总是记录较大子节点的索引  biggerIndex++;}}//如果k节点的值小于其较大的子节点的值  if(data[k]<data[biggerIndex]){//交换他们
                   swap(data,k,biggerIndex);//将biggerIndex赋予k，开始while循环的下一次循环，重新保证k节点的值大于其左右子节点的值  k=biggerIndex;}else{break;}}}}

public static void mergeSort(int[] numbers, int left, int right) {  int t = 1;// 每组元素个数  int size = right - left + 1;  while (t < size) {  int s = t;// 本次循环每组元素个数  t = 2 * s;  int i = left;  while (i + (t - 1) < size) {  merge(numbers, i, i + (s - 1), i + (t - 1));  i += t;  }  if (i + (s - 1) < right)  merge(numbers, i, i + (s - 1), right);  }
}
private static void merge(int[] data, int p, int q, int r) {  int[] B = new int[data.length];  int s = p;  int t = q + 1;  int k = p;  while (s <= q && t <= r) {  if (data[s] <= data[t]) {  B[k] = data[s];  s++;  } else {  B[k] = data[t];  t++;  }  k++;  }  if (s == q + 1)  B[k++] = data[t++];  else  B[k++] = data[s++];  for (int i = p; i <= r; i++)  data[i] = B[i];
}

public void sort(int[] array) {//首先确定排序的趟数;    int max = array[0];for (int i = 1; i < array.length; i++) {if (array[i] > max) {max = array[i];}}int time = 0;//判断位数;    while (max > 0) {max /= 10;time++;}//建立10个队列;    List<ArrayList> queue = new ArrayList<ArrayList>();for (int i = 0; i < 10; i++) {ArrayList<Integer> queue1 = new ArrayList<Integer>();queue.add(queue1);}//进行time次分配和收集;    for (int i = 0; i < time; i++) {//分配数组元素;    for (int j = 0; j < array.length; j++) {//得到数字的第time+1位数;  int x = array[j] % (int) Math.pow(10, i + 1) / (int) Math.pow(10, i);ArrayList<Integer> queue2 = queue.get(x);queue2.add(array[j]);queue.set(x, queue2);}int count = 0;//元素计数器;    //收集队列元素;    for (int k = 0; k < 10; k++) {while (queue.get(k).size() > 0) {ArrayList<Integer> queue3 = queue.get(k);array[count] = queue3.get(0);queue3.remove(0);count++;}}}