JAVA冒泡排序（递归以及非递归）

非递归：

public class kS {
public static void BubbleSort(int a[],int n){
int tmp;
boolean exchange;
for(int i=0;i<n-1;i++){
exchange = false;
for(int j=n-1;j>i;j--){
if(a[j]<a[j-1]){
tmp = a[j];
a[j] = a[j-1];
a[j-1] = tmp;
exchange = true;
}
}
if(exchange == false){
return;
}
}
}
public static void disp(int a[],int n){
for(int i=0;i<n;i++){
System.out.printf("%2d",a[i]);
}
System.out.println();
}


public static void main(String[] args) {
int n = 10;
int []a = {2,4,6,3,5,9,1,7,8,0};
System.out.println("排序前：");
disp(a,n);
BubbleSort(a,n);
System.out.println("排序后：");
disp(a,n);

}

}

递归：

public class kS {


public static void BubbleSort(int a[],int n,int i){
int tmp;
boolean exchange;
if(i == n-1) return;
else{
exchange = false;
for(int j=n-1;j>i;j--){
if(a[j]<a[j-1]){
tmp = a[j];
a[j] = a[j-1];
a[j-1] = tmp;
exchange = true;
}
}
if(exchange == false){
return;
}
else{
BubbleSort(a,n,i+1);
}
}

}
public static void disp(int a[],int n){
for(int i=0;i<n;i++){
System.out.printf("%2d",a[i]);
}
System.out.println();
}


public static void main(String[] args) {
int n = 10;
int []a = {2,4,6,3,5,9,1,7,8,0};
System.out.println("排序前：");
disp(a,n);
BubbleSort(a,n,0);
System.out.println("排序后：");
disp(a,n);

}

}