代码:
package com.lianxiti;
public class Bubbling {
public static void main(String[] args) {
System.out.println("冒泡排序:");
int arr[] = {85,20,56,90,26} ;
boolean falg = false; //判断是否继续后续的比较轮数;
int tep = 0 ; //临时变量;
//外层循环控制比较的轮数,每论选出当前论的最大数;
//内层循环控制每轮的比较次数;
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-i-1; j++) {
if(arr[j]>arr[j+1]){
tep = arr[j]; //以下三条是交换数据;
arr[j] = arr[j+1];
arr[j+1] = tep;
falg = true;
}
}
if(!falg){
break; //循环结束,无需将继续比较;
}
}
for (int i = 0; i < arr.length; i++) {
System.out.println("从小到大为:"+arr[i]); //输出a[0]~a[4]的数据;
}
}
}
538