算法系统学习-1排序-快速排序

import java.util.*; public class QuickSort {    public int[] quickSort(int[] A, int n) {        // write code here        quicksort(A,0,n-1);                 return A;    }    public void quicksort(int [] a,int low,int high)    {      if(low<high)      {          int p = partition(a,low,high);          quicksort(a,low,p-1);          quicksort(a,p+1,high);      }    }    public int partition(int []a,int low,int high)    {       int pivot=a[low];        while(low<high)        {           while(low<high&&a[high]>=pivot)               {high--;}            a[low]=a[high];           while(low<high&&a[low]<=pivot)               {low++;}            a[high]=a[low];        }        a[low]=pivot;        return low;    }}