int []shu ={30,80,96,45,8,35};
for (int i=0;i<(shu.length-1);i++){
for (int p=0;p<(shu.length-1-i);p++){
if (shu[p]>shu[p+1]){
int huan=shu[p];
shu[p]=shu[p+1];
shu[p+1]=huan;
}
}
}
//输出冒泡排序的数组
//for (int l=0;l
for (int l:shu){
//System.out.print(l+"\t");
System.out.print("第"+l+"个数为:"+l);
}
}