分治算法——快速排序

public class Qsort {
  public static void    Qsort(int A[],int low,int high){
      if(low>=high)return;
      int key=A[low];
      int i=low,j=high;
      while(i<j){
        while(i<j&&A[j]>=key)j--;
        A[i]=A[j];
        while(i<j&&A[i]<=key)i++;
        A[j]=A[i];
      }
      A[i]=key;
     if(low<high){
         int middle=i;
         Qsort(A,low,middle-1);
         Qsort(A,middle+1,high);
     }
  }
}