/**
* 冒泡排序
*/
public class Test {
public static void main(String[] args){
int x[] = {23,11,66,45,99,56};
for(int i = 0 ;i<x.length-1;i++){
for(int j = 0;j <x.length-1-i;j++){
if(x[j]>x[j+1]){
int t = x[j];
x[j] = x[j+1];
x[j+1] = t;
}
}
}
for(int a= 0;a<x.length;a++){
if(a==x.length-1){
System.out.print(x[a]);
}else
System.out.print(x[a]+",");
}
}
}
最简单的冒泡排序
最新推荐文章于 2022-04-30 19:21:03 发布