studentclass.java

Java与面向对象程序设计实验教学讲义.复数类的实现,复数类的复杂运算,身份证号码的分析,图形界面设计

//StudentClass.java
//声明学生班级类StudentClass

public class StudentClass{
	private String name;             //班级名称
	static int capacity = 40;        //最大容量
	private Student students[];      //学生
	private int size;                //实际人数
	//构造方法
	public StudentClass(String name, int size){
            this.name = name;
            this.size = size;
            students = new Student[capacity];
	}
	 
        public String getName(){
            return name;
	}
        
       public int getCapacity(){
            return capacity;
	}        
	public Student[] getStudents(){
            return students;
}
	public int getSize(){
            return size;
	}    
	public void setName(String name){
            this.name = name;
	}        
        public void setCapacity(int capacity){
            this.capacity = capacity;
	}        
	public void setSize(int size){
            this.size = size;		
	}
        public void setStudents(Student[] students){
            for (int i = 0; i<size; i++)
		this.students[i] = new Student(students[i]);
        }	
	public String toString(){
            String s;
            s = "     班级:" + name +"\t" + "容量:" + capacity + "\t" + "实际人数:" 
                    + size +"\n\n";
	    s = s + "学号"+"\t" + "姓名"+"\t" + "英语"+"\t" + "数学"+"\t" + "计算机"
                    +"\t" + "总成绩\n";		
	    for (int i=0; i<size; i++)
		  s = s + students[i].getId()+"\t"+students[i].getName()+"\t"
                        +students[i].getEng()+"\t"+students[i].getMath()+"\t"
                        +students[i].getComp()+"\t"+students[i].getSum()+"\n";		  
	   return s;
	}
        public void selectionSort(){
		Student temp;
		for (int i=0; i<size-1; i++)
		  for (int j=i+1;j<size;j++)
		    if (students[j].compare(students[i])>0) {
		    	temp = students[i];
		    	students[i] = students[j];
		    	students[j] = temp;
		    }
       }
        public void insertSort(){
		Student temp;
		for (int i=1; i<size; i++){
			temp = students[i];
			int j = i-1;
			while (j>-1 && temp.compare(students[j])>0){
				students[j+1] = students[j];
				j--;
			}
			students[j+1] = temp;
		}		
	 }

}