按照考分对学生排序，针对学生的正确答案个数的升序来显示学生

按照考分对学生排序，针对学生的正确答案个数的升序来显示学生

分析：

1.与正确答案比较，然后获得学生的正确答案个数。

2.将学生的序号放入一个数组中，按学生的序号将其正确答案的个数也放入一个数组中。

3.对正确答案个数以升序的形式进行快速排序，当学生对应的答案个数发生改变时，学生的序号跟着一起改变

以保持一致。

package jing.able;


/**
 * @author: panjing
 * @describe: 按照考分对学生排序
 * @date: 2019/5/6
 * @time: 16:45
 */

public class SortStudent {
    public static void main(String[] args) {
        char[][] answers = {
                {'A','B','A','C','C','D','E','E','A','D'},
                {'D','B','A','B','C','A','E','E','A','D'},
                {'E','D','D','A','C','B','E','E','A','D'},
                {'C','B','A','E','D','C','E','E','A','D'},
                {'A','B','D','C','C','D','E','E','A','D'},
                {'B','B','E','C','C','D','E','E','A','D'},
                {'B','B','A','C','C','D','E','E','A','D'},
                {'E','B','E','C','C','D','E','E','A','D'}
        };
        char[] keys = {'D','B','D','C','C','D','A','E','A','D'};
        int[] count = new int[10];  //存放学生正确答案的个数
        int[] num = {0,1,2,3,4,5,6,7};  //用来标记学生序号
        for (int i = 0; i < answers.length; i++) {
            int correctCount = 0;
            for (int j = 0; j < answers[i].length; j++) {
                if (answers[i][j] == keys[j]){
                    correctCount++;
                }
            }
            count[i] = correctCount;
        }
        for (int i = 0; i < answers.length; i++) {
            for (int j = i+1; j < answers.length; j++) {
                if (count[j] < count[i]) {
                    int tmp1 = count[j];
                    count[j] = count[i];
                    count[i] = tmp1;
                    int tmp2 = num[j];
                    num[j] = num[i];
                    num[i] = tmp2;    //序号和正确答案个数一起改变
                }
            }
        }
        for (int i = 0; i < answers.length; i++) {
            System.out.println( "student"+num[i] +"'s correct count is" + count[i]);
        }
    }

}