public class quickSort {
static void quickSortM(int[] s, int l, int r){
if (l < r){
int x = s[l];
int i = l,j = r;
while (i < j){
while (i < j && s[j] >= x){
j--;
}
if (i<j)
s[i++] = s[j];
while (i <j && s[i] < x){
i++;
}
if (i<j){
s[j--] = s[i];
}
}
s[i] = x;
quickSortM(s,l,i-1);
quickSortM(s,i+1,r);
}
}
public static void main(String[] args){
int s[] = {72,92,3,88,43,100,56};
quickSortM(s,0,s.length-1);
int j;
for (j=0;j<s.length;j++)
System.out.println(s[j]);
}
}
快速排序的算法:以s[l]为基准,从r,从右向左比较,找到比s[l]小的就放到s[i],从l,从左向右比较,找到比s[l]大的就放到s[j]如此递归public class quickSort { static void quickSortM(int[] s, int l, int r){ if (l < r){ int x = s[l]; int i = l,j = r;