package kuaisupaixu;
public class paiXu {
public static void main(String[] args) {
int arr[] = new int[]{3,5,1,8,4,9,2,6,7};
int len = arr.length-1;
arr=qsort(arr,0,len);
for (int i=0;i<arr.length;i++) {
System.out.print(arr[i]+"\t");
}
}
public static int[] qsort(int arr[],int start,int end) {
int pivot = arr[start];
int i = start;
int j = end;
while (i<j) {
while ((i<j)&&(arr[j]>pivot)) {
j--;
}
while ((i<j)&&(arr[i]<pivot)) {
i++;
}
if ((arr[i]==arr[j])&&(i<j)) {
i++;
} else {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
if (i-1>start) arr=qsort(arr,start,i-1);
if (j+1<end) arr=qsort(arr,j+1,end);
return (arr);
}
}
Java基础 -> 快速排序
于 2020-08-01 23:06:24 首次发布