package 数组;
public class 冒泡排序 {
public static void main(String[] args) {
int[] num1={10,20,80,30,5,58,95};
int len=num1.length;
int a;
for(int i=0;i<len-1;i++){
for(int j=0;j<len-1-i;j++){
if(num1[j]<num1[j+1]){
a=num1[j];
num1[j]=num1[j+1];
num1[j+1]=a;
}
}
}
//解决有相同数出现的问题
for(int i=1;i<len;i++){
if(num1[i]==0){
num1[i]=num1[i-1];
}
}
//输出
/* System.out.print("原数组：");
for(int i=0;i<len;i++)
{System.out.print(num1[i]+" ");}
*/ System.out.println();
System.out.print("排序后：");
for(int i=0;i<len;i++){
System.out.print(num1[i]+" ");}
}
}
