public class kuaisupaixu {
static Comparable[] a= {1,34,54,46,67,75,90};
private static void qSort(Comparable[] a2, int p,int r) {
if(p<r) {
int q=partition(a,p,r);
qSort(a2, p,q-1);
qSort(a2, q+1,r);
}
}
private static int partition(Comparable a[],int p,int r) {
int i=p,j=r+1;
Comparable x=a[p];
while(true) {
while(a[++i].compareTo(x)<0&&i<r);
while(a[--j].compareTo(x)>0);
if(i>j) break;
swap(a,i,j);
}
a[p]=a[j];
a[j]=x;
return j;
}
public static void swap(Comparable a[],int i,int j){
int temp=(int) a[i];
a[i]=a[j];
a[j]=temp;
}
public static void main(String[] args) {
qSort(a,0,a.length-1);
for(int i=0;i<a.length;i++) {
System.out.println(a[i]);
}
}}
快速排序java
最新推荐文章于 2024-05-16 10:23:10 发布