冒泡排序的demo

外层是需要比对的次数
内层是比较的逻辑处理

public static void main(String[] args) {
int[] num={1,5,2,4,9};
for (int i = 0; i for (int j = 0; j if (num[j]>num[j+1]) {
int emp = num[j];
num[j] = num[j+1];
num[j+1] = emp;
}
}
}
for (int i = 0; i System.out.printf(""+num[i]);
}