public class 降序 {
public static void main(String[] args) {
int[] scores = { 2, 8, 13, 12, 34};
//冒泡排序
//外层循环比较的轮数, 长度 -1
for (int i = 0; i< scores.length -1; i++) {
//内层循环每轮比较的次数 ,长度-1轮数
for(int j =0; j< scores.length -1 -i; j++) {
//判断相邻两个数的大小
if (scores[j] < scores[ j + 1]) {
//交换
int temp = scores[j];
scores[j] = scores[ j + 1 ];
scores[ j + 1 ] = temp;
}
}
}
//排序后的数列
for (int i = 0; i< scores.length; i++) {
System.out.println(scores[i] + "\t");
}
}
}