冒泡排序-

冒泡排序

int[] aa = new int[]{5, 45, 35, 4, 14, 23, 74, 54, 25};
System.out.println(Arrays.toString(aa));
for (int i = 0; i < aa.length - 1; i++) {
for (int j = 0; j < aa.length - 1 - i; j++) {
//if (aa[j] > aa[j + 1]) { 大于号：升序；小于号：降序；
if (aa[j] < aa[j + 1]) {
int t = aa[j];
aa[j] = aa[j + 1];
aa[j + 1] = t;
}
}
}
System.out.println(Arrays.toString(aa));