Windows程序设计作业2（对象集合排序）

一、题目：

学生类包括成绩、科目和学号，请根据课程成绩grade将学生进行排序。

二、解题思路：

先创建一个接口，接口中包含了包括成绩、科目和学号。在这里设计IComparable.CompareTo(Object obj)进行两两排序。最后在主函数中进行循环比较出五个学生成绩的大小。

三、详细过程

（1）先创建IComparable接口

public class Student : IComparable
{
    public double mygrade;
    public string mysubject, myID;
    public Student() { }
    public Student(double grade, string subject, string id)
    {
        mygrade = grade;
        mysubject = subject;
        myID = id;
    }
    
    int IComparable.CompareTo(Object obj)
    {
        if (obj is Student)
        {
            Student castObj = (Student)obj;
            if (this.mygrade > castObj.mygrade) return 1;
            else if (this.mygrade < castObj.mygrade) return -1;
            else return 0;
        }
        throw new ArgumentException("object is not a student");
    }

}

（2）主函数

internal class Program
{
    static void Main(string[] args)
    {
        Student[] students = new Student[5];
        students[0] = new Student(50.0, "windows程序设计", "001");
        students[1] = new Student(90.0, "windows程序设计", "002");
        students[2] = new Student(100.0, "windows程序设计", "003");
        students[3] = new Student(70.0, "windows程序设计", "004");
        students[4] = new Student(80.0, "windows程序设计", "005");
        //请在此处添加关键代码···
        Array.Sort(students);  //默认只对基本类型排序
        foreach (Student student in students)
        {
            Console.WriteLine(student.mygrade + " " + student.mysubject + " " + student.myID);
            
        }
        Console.Read();
    }
}

（3）完整代码

public class Student : IComparable
{
    public double mygrade;
    public string mysubject, myID;
    public Student() { }
    public Student(double grade, string subject, string id)
    {
        mygrade = grade;
        mysubject = subject;
        myID = id;
    }
    
    int IComparable.CompareTo(Object obj)
    {
        if (obj is Student)
        {
            Student castObj = (Student)obj;
            if (this.mygrade > castObj.mygrade) return 1;
            else if (this.mygrade < castObj.mygrade) return -1;
            else return 0;
        }
        throw new ArgumentException("object is not a student");
    }

}

internal class Program
{
    static void Main(string[] args)
    {
        Student[] students = new Student[5];
        students[0] = new Student(50.0, "windows程序设计", "001");
        students[1] = new Student(90.0, "windows程序设计", "002");
        students[2] = new Student(100.0, "windows程序设计", "003");
        students[3] = new Student(70.0, "windows程序设计", "004");
        students[4] = new Student(80.0, "windows程序设计", "005");
        //请在此处添加关键代码···
        Array.Sort(students);  //默认只对基本类型排序
        foreach (Student student in students)
        {
            Console.WriteLine(student.mygrade + " " + student.mysubject + " " + student.myID);
            
        }
        Console.Read();
    }
}

（4）结果截图

四、小结

从上面的结果可得，在使用Sort后，集合中的元素是按照学生基本类型进行排序，在默认情况下，Sort方法是将集合中的元素从小到大输出的，由于在Student类中重写了CompareTo方法，因此会按照预先定义好的排序规则对学生的信息排序。
五、源码开源地址

https://gitee.com/shallow-singing_2_0/paixu.git