八大排序算法之冒泡排序

public static void main(String[] args) {
int a[] = {6,3,7,9,1,4,2,5,8};
for (int i = 0; i < a.length; i++) {
System.out.printf("%d " , a[i]);
}
for (int i = 0; i < a.length; i++) {
for (int j = i+1; j < a.length; j++) {
if(a[j] < a[i]){
int tmp= a[i];
a[i] = a[j];
a[j] = tmp;
}
}
}
System.out.println();
for (int i = 0; i < a.length; i++) {
System.out.printf("%d " , a[i]);
}
}