冒泡法排序

package maopao;


public class maopao {
public static void main(String[]args){
int[]a=new int[]{8,3,1,4,6,9,0};
for(int i=a.length-1;i>0;i--){
System.out.println(i);
for(int j=0;j<i;j++){
//System.out.println(j);
if (a[j+1]<a[j]){
int k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
}
}
for(int j=0;j<a.length;j++){
System.out.print(a[j]+" ");
}
}
}