import java.util.Arrays;
public class kuaipai {
/**
*快速排序
* */
public static void QuickSort(int []arr,int left,int right){
if(left<right){
int low=left;
int hight=right;
int piovt=arr[low];
while(low<hight){
while(low<hight && arr[hight]>piovt)
hight--;// 从右向左找第一个小于piovt的数
if(low<hight)arr[low++]=arr[hight];
while(low<hight && arr[low]<piovt)
low++;// 从左向右找第一个大于piovt的数
if(low<hight)arr[hight--]=arr[low];
}
arr[low]=piovt;
QuickSort(arr,left,low-1);
QuickSort(arr,low+1,right);
}
}
public static void main(String[] args) {
int []arr = {3,2,5,8,4,7,6,9};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
}
}