冒泡排序

public static void main (String[ ] args){
//定义一个无序的数组
int [ ] a = {10,9,3,88,7};
//打印原始数组 i 表示每一个元素
for (int i : a){
System.out.print(i + " ");
}
System.out.println(" ");
//两两比较a.lengt = 5;从0-4是五个数字,实际比较四次,所以是从0-3,是四次
for (int j = 1;j <a.length; j++){
for(int i = 0; i<a.length - j; i++){
//当a[i]大于a[i+1]时,进行交换
if(a[ i] >a[i+1 ]){
//a[i]被替换前,先把a[i]的值保持
int tmp = a[i+1];
a[i+1] = a[i];
//把保存啊a[i]的临时变量tmp赋值给a[i+1]
a[i] =tmp;
}
System.out.println(Arrays.toString(a));
}
}
}
原文地址:https://www.cnblogs.com/xusuming/p/12964808.html