C语言学生管理系统（链表）(3)

p->student.score[3]=score[3]; if(head1==NULL) { } else {

while(pr->student.studentIDnext!=NULL) { }

if(pr->student.studentID>=studentID) {

if(pr==head1) { } else {

pr=temp; p->next=head1; head1=p; temp=pr; pr=pr->next; head1=p;

}

}

}

}

p->next=pr->next; pr->next=p;

else { }

pr->next=p;

return;

voidInsertNode(longlongstudentID,charstudentName[10],charstudentSex[4],intscore[4]) {

structlink*pr=head1,*p=head1,*temp=NULL; intsum,sum1;

p=(structlink*)malloc(sizeof(structlink)); if(p==NULL) {

printf(\内存申请失败\);

}

return;

p->next=NULL;

p->student.studentID=studentID;

strcpy(p->student.studentName,studentName); strcpy(p->student.studentSex,studentSex); p->student.score[0]=score[0]; p->student.score[1]=score[1]; p->student.score[2]=score[2]; p->student.score[3]=score[3];

sum=p->student.score[0]+p->student.score[1]+p->student.score[2]

+p->student.score[3];

sum1=pr->student.score[0]+pr->student.score[1]+pr->student.scorif(head1==NULL) { } else {

head1=p;

e[2]+pr->student.score[3];

while(sum1>sum&&pr->next!=NULL)

{

temp=pr; pr=pr->next;

sum1=pr->student.score[0]+pr->student.score[1]+pr->student.scor

e[2]+pr->student.score[3];

}

if(sum1<=sum) { } else

if(pr==head1) { } else { }

pr=temp;

p->next=pr->next; pr->next=p; p->next=head1; head1=p;

}

}

{ }

pr->next=p;

return;

voidDeleteNodeID()//输入学号删除 {

structlink*p=head,*pr=head; longlongstudentID=0; if(head==NULL){ }

printf(\请输入你要删除的学生的学号\); scanf(\,studentID);

while(studentID!=p->student.studentID&&p->next!=NULL) {

pr=p;

printf(\对不起，没有数据可以删除\); return;

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，免费范文网，提供经典小说综合文库C语言学生管理系统（链表）(3)在线全文阅读。