Java输入5名学员成绩进行降序排列（冒泡排序）

冒泡排序：

每次比较相邻两数
小的交换到前面
每轮结束后最大的数交换到最后

示例：

package ch07;

import java.util.Scanner;

public class Maopao {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int chengji[] = new int[5];
		System.out.println("请输入5名同学的成绩：");
		for (int i = 0; i < chengji.length; i++) {
			chengji[i] = sc.nextInt();
		}

		for (int i = 0; i < chengji.length - 1; i++) {
			for (int j = 0; j < chengji.length - 1 - i; j++) {
				if (chengji[j] < chengji[j + 1]) {
					int a = chengji[j];
					chengji[j] = chengji[j + 1];
					chengji[j + 1] = a;
				}
			}
		}
		System.out.print("学员成绩按降序排列为：");
		for (int i = 0; i < chengji.length; i++) {
			System.out.print(chengji[i] + "\t");
		}
	}
}