冒泡排序Java实现

public class Bubble {


public static void main(String[] args) {
int b[] = {9,3,28,6,34,7,10,27,1,5,8};
int a[] = {1,2,3,4,5,6,7,8,9,10,11,12};
show(a);
for(int i=0;i<a.length-1;i++){
int num = bubbleOne(a,a.length-i);
if(num==0){
break;
}
}

show(a);
}

static int bubbleOne(int a[],int n){
int num = 0;
for(int i=0;i<n-1;i++){
if(a[i]>a[i+1]){
int temp = a[i];
a[i] = a[i+1];
a[i+1] = temp;
num++;
}
}
return num;
}

static void show(int a[]){
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
System.out.println();
}


}