冒泡排序实例

public class MaopaoSort{

public static void main(String[] args) {
// TODO Auto-generated method stub
//冒泡排序
int a[]={10,12,14,15,9,4};
for (int i = 0; i < a.length-1; i++) {
for (int j = 0; j < a.length-1-i; j++) {
if (a[j]>a[j+1]) {
int temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}

}
}
System.out.println("排序后的结果");
for (int i = 0; i < a.length; i++) {
int j = a[i];
System.out.print(j+ "  ");
}

}

}