冒泡算法

package suanfa;


public class BubbleSort {
static final int SIZE=10;
public static void bubble(int[] a){
int temp;
for(int i=1;i<a.length;i++){
for(int j=0;j<a.length-i;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
System.out.print("第"+i+"步排序结果:");
for(int k=0;k<a.length;k++){
System.out.print(" "+a[k]);
}
System.out.print("\n");
}
}
public static void main(String[] args) {
int[] shuzu=new int[SIZE];
int i;
for( i=0;i<SIZE;i++){
shuzu[i]=(int)(100+Math.random()*(100+1));
}
System.out.print("排序前的数组为: \n");
for(i=0;i<SIZE;i++){
System.out.print(shuzu[i]+" ");
}
System.out.print("\n");
bubble(shuzu);
System.out.print("排序后的数组为：\n");
for(i=0;i<SIZE;i++){
System.out.print(shuzu[i]+" ");
}
System.out.print("\n");
}
}