数据结构课程设计 学生成绩管理系统

}

}

}

}

t2=q->next;

p->next=p->next->next; q->next=q->next->next; t1->next=q->next; q->next=t1; t2->next=p->next; p->next=t2;

break;

case 3: }

Queue_Subject(L); //科目排序 break;

void Out_one_Student(LinkList *L,int i) //输出第i个学生 {

int j=0; LinkList *p=L; while(j

printf(\

j++; p=p->next;

e,p->score[0],p->score[1],p->score[2],p->all_score,p->ave_score);

}

int Seek_Student(LinkList *L) //查找学生 1 按学号查找 2 按姓名查找 {

26

}

int m;

printf(\按学号查找 2 按姓名查找 3 退出\\n请输入：\scanf(\switch(m) { case 1:

char a[12];

printf(\输入学号：\scanf(\

return (Locate_Student(L,a)); //返回学号查找到的值 break;

case 2:

char b[20];

printf(\输入姓名：\scanf(\

return(Locate_Student1(L,b)); break;

case 3: }

break;

void Filter_Student(LinkList *&L) //筛选 {

LinkList *s,*p=L->next,*r,*q; int y,count2=0;

printf(\按总分选 2 全部及格的人 3 按各科成绩 4 退出\\n请输入：\scanf(\switch(y) { case 1:

s=(LinkList *)malloc(sizeof(LinkList));

27

q=s; int i; float all;

printf(\您要总分多少分以上的人，请输入：\scanf(\

for (i=0;inext) { }

output_Student(s,count2); free(s); break;

28

if (p==NULL) { }

if(p->all_score>all) { }

r=(LinkList *)malloc(sizeof(LinkList)); strcpy(r->mun,p->mun); strcpy(r->name,p->name); r->score[1]=p->score[1]; r->score[2]=p->score[2]; r->score[0]=p->score[0]; r->all_score=p->all_score; r->ave_score=p->ave_score; q->next=r; q=q->next; q->next=NULL; count2++; printf(\没有\return;

case 2:

s=(LinkList *)malloc(sizeof(LinkList)); q=s; int j;

for (j=0;jnext) { }

output_Student(s,count2); free(s); break;

29

if (p==NULL) { }

if(p->score[0]>59&&p->score[1]>59&&p->score[2]>59) { }

r=(LinkList *)malloc(sizeof(LinkList)); strcpy(r->mun,p->mun); strcpy(r->name,p->name); r->score[1]=p->score[1]; r->score[2]=p->score[2]; r->score[0]=p->score[0]; r->all_score=p->all_score; r->ave_score=p->ave_score; q->next=r; q=q->next; q->next=NULL; count2++; printf(\没有\return;

case 3:

s=(LinkList *)malloc(sizeof(LinkList)); q=s; int k,x;

printf(\选择 1 数据结构及格的 2 数字信号处理及格的 3 数电及

格的\\n\

printf(\请输入:\scanf(\

for (k=0;knext) { }

30

if (p==NULL) { }

if(p->score[x-1]>59) { }

r=(LinkList *)malloc(sizeof(LinkList)); strcpy(r->mun,p->mun); strcpy(r->name,p->name); r->score[1]=p->score[1]; r->score[2]=p->score[2]; r->score[0]=p->score[0]; r->all_score=p->all_score; r->ave_score=p->ave_score; q->next=r; q=q->next; q->next=NULL; count2++; printf(\没有\return;