快速排序和堆排序

//快速排序    
public static  <T extends Comparable> int partion(T a[],int low,int high)
    {
        T pivo=a[low];
        while(low<high)
        {
            while(low<high&&pivo.compareTo(a[high])<=0)
            {
                high--;
            }
            a[low]=a[high];
            while(low<high&&pivo.compareTo(a[low])>=0)
            {
                low++;
            }
            a[high]=a[low];
        }
        a[low]=pivo;
        return low;
    }
    public static <T extends Comparable> void QSort(T a[],int low,int high)
    {
        if(low<high)
        {
            int pivoLoc=partion(a, low, high);
            QSort(a,low,pivoLoc-1);
            QSort(a,pivoLoc+1,high);
            
        }
    }

  //堆排序
  public static void ajustHeap(int a[],int s,int size)
  {
    int temp=a[s];
    for(int j=2*s+1;j<size;j=j*2+1){
      if(j+1<size&&a[j]<a[j+1])
      {
        j++;
      }
      if(a[j]<=temp){
        break;
      }
      a[s]=a[j];
      s=j;
    }
    a[s]=temp;
  }
  public static void heapSort(int a[])
  {
    // build heap
    for(int i=a.length/2-1;i>=0;i--) {
      ajustHeap(a, i, a.length);
    }
    for(int i=a.length-1;i>0;i--)
    {

      int temp=a[i];
      a[i]=a[0];
      a[0]=temp;
        ajustHeap(a, 0,i);
    }
  }

//测试
public static void main(String[] args) {
        Integer arr[]={3,1,6,2,8,89,4,4,6,9};
        int a[]={3,1,6,2,8,89,4,4,6,9};
        System.out.println("qsort sort");
        QSort(arr,0,arr.length-1);
        for(Integer i:arr)
            System.out.print(i+" ");
        System.out.println("heap sort");
        heapSort(a);
        for(Integer i:a)
            System.out.print(i+" ");
    }