1.作业内容:
学生类包括成绩、科目和学号,请根据课程成绩grade将学生进行排序。
部分代码如下,请将代码补充完整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; } 请在此处添加关键代码···}internal class Program{ private 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"); 请在此处添加关键代码··· }}
2.设计思路:
定义学生类:在类中直接实现接口。
主过程函数调用:在主函数中创建学生对象集合,直接调用sort()来实现排序,编译器直接调用接口实现类。
3.核心代码:
using System;
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 a)
{
if (a is Student)
{
Student stu = (Student)a;
if (this.mygrade > stu.mygrade) return 1;
else if (this.mygrade < stu.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 s in students)
{
Console.WriteLine(s.mygrade + " " + s.mysubject + " " + s.myID);
}
}
}
4.结果展示
5.总结
本次实验诣在掌握一种由定义由值类型或类实现的排序方法。
6.开源地址