public static void quickSort(int[]a,int left,int right){
int i=left;
int j=right;
if(left>right){
return;}
int temp=a[left];
while(i!=j){
while(a[j]>=temp&&i<j){
j--;
}
while(a[i]<=temp&&i<j){
i++;
}
if(i<j){
int t=a[i];
a[i]=a[j];
a[j]=t;
}
}
a[left]=a[i];
a[i]=temp;
quickSort(a,left,i-1);
quickSort(a,i+1,right);
}
public static void main(String[] args) {
int[] a={2,3,41,22,23,33,56,21,23,123,125};
quickSort(a,0,a.length-1);
for(int i=0;i<a.length;i++){
System.out.println(a[i]);
}
}
结果: