快速排序

public static void quickSort(int [] arr,int low,int high){

if(low>high)

return;

int i=low;

int j=high;

int base=arr[low];

while(i<j){

while(base<=arr[j]&&i<j){

j--;

}

while(base>=arr[i]&&i<j){

i++;

}

if(i<j){

int t=arr[i];

arr[i]=arr[j];

arr[j]=t;

}

}

arr[low]=arr[i];

arr[i]=base;

quickSort(arr,low,j-1);

quickSort(arr,j+1,high);

}