java最简洁冒泡排序算法
package com.wgf.algorithm;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
int [] a={6,4,15,12,1,8,33,21,10};
System.out.println("排序前顺序为:");
for(int m:a){
System.out.print(m+",");
}
System.out.println();
int temp=0;int flag;
for(int i =0;i<=a.length;i++){
for(int j=1;j<a.length;j++){
if(a[j-1]>a[j]){
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
}
System.out.println("排序后顺序为:");
for(int v:a){
System.out.print(v+",");
}
}
}
输出结果:
排序后顺序为:
6 4 15 12 1 8 33 21 10
排序后顺序为:
1 4 6 8 10 12 15 21 33