//冒泡排序
int[] array=new int[]{2,4,0,14,34,3,89,12};
for(int i=0;i<array.length;i++){
for(int j=0;j<array.length-1-i;j++){
if(array[j]<array[j+1]){
int temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
for (int v:array) {
System.out.println(v);
}
//九九乘法表
for (int i=1;i<=9;i++){
for (int j=1;j<=i;j++){
System.out.print(j+"*"+i+"="+i*j+"\t");
}
System.out.println();
}
冒泡排序和九九乘法表
最新推荐文章于 2021-04-22 19:40:15 发布