package Sort;
import java.util.Arrays;
public class QuickSort2 {
public static void main(String[] args) {
int[] arr={4,3,2,1,5,9,8,7,6,};
quickSort(arr,0,arr.length-1);
System.out.println("快速排序后的数组为:"+Arrays.toString(arr));
}
public static void quickSort(int[] arr,int left,int right){
if (left<right){
int index=quick(arr,left,right);
quickSort(arr, left, index-1);
System.out.println(Arrays.toString(arr));
quickSort(arr, index+1, right);
System.out.println(Arrays.toString(arr));
}
}
public static int quick(int[] arr,int left,int right){
int val=arr[left];
while(left<right){
while(left<right&&arr[right]>=val){
right--;
}
if (left<right){
arr[left]=arr[right];
left++;
}
while (left<right&&arr[left]<val){
left++;
}
if (left<right){
arr[right]=arr[left];
right--;
}
}
arr[left]=val;
return left;
}
}