Java 快排 排序

一、快排的一种

====================

public class myMain {
public static void main(String[] args) {
int t[] = {2,6,7,8,5,4},low,high;
low = 0;
high = t.length-1;
allSort(t,low,high);
for(int t1:t){
System.out.print(t1);
}
}
public static void allSort(int[] t,int x,int y){

if(x >= y){
return;
}
int index = partSort(t, x, y);
allSort(t, x, index-1);
allSort(t, index+1, y);
}
public static int partSort(int[] t,int x,int y){

int key = t[x];
while(x < y){
while(t[y] >= key && y>x){
y--;
}
t[x] = t[y];
while(t[x] <= key && y>x){
x++;
}
t[y] = t[x];
}
t[y] = key;

return y;
}

}

二、排序

public static void main(String[] args) {

int a[] = {2,6,7,5,4},k,z=0;

for(int i = 0; i < a.length-1; i++){
k = a[i];
for(int j = i+1; j < a.length;j++){
System.out.println("===="+i);
if(a[j] < k){
int temp = a[j];
a[j] = k;
k = temp;
}
}
a[i] = k;
}

for(int b:a){
System.out.print(b);
}

}

}

转载于:https://www.cnblogs.com/Javaknowledge/p/6724723.html