快速排序--Java

import java.util.Arrays;

public class Quick_Sort {
public static void main(String[] args){
int[] s={2,7,3,6,5,9};
System.out.println("快速排序--》");
quick_sort(s, 0, s.length-1);
System.out.println(Arrays.toString(s));

}

public static void quick_sort(int[] s,int left,int right){
if(left<right){
int i=left,j=right;
int X=s[i];
while(i<j){
while(i<j&&s[j]>=X)
j--;
s[i]=s[j];
while(i<j&&s[i]<X)
i++;
s[j]=s[i];
}
s[i]=X;
System.out.println("排序中间结果-->"+Arrays.toString(s));
quick_sort(s, left, i-1);
quick_sort(s, i+1, right);
}
}

}