x[4],intscore[4]) {
structlink*p=NULL,*pr=head;
p=(structlink*)malloc(sizeof(structlink)); if(p==NULL) { }
if(head==NULL) { } else{ }
p->student.studentID=studentID;
strcpy(p->student.studentName,studentName);
while(pr->next!=NULL) { }
pr->next=p;
pr=pr->next; head=p;
printf(\申请内存失败\); return;
}
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]; p->next=NULL; return;
voidNumberSorting(intflag) {
structlink*p=head; structlink*p1=head1; intsum=0;
if(p==NULL) { }
while(p!=NULL) {
switch(flag) {
printf(\没有数据，无法排序\); return;
case1:
InsertNode(p->student.studentID,p->student.studentName,p->stude
nt.studentSex,p->student.score);
break;
case2:
InsertNodeNumber(p->student.studentID,p->student.studentName,p-
>student.studentSex,p->student.score); }
voidDisplayNode(structlink*head) {
structlink*p=head; if(p==NULL)
}
DisplayNode(head1);
break;
default: }
p=p->next;
printf(\程序异常，请重试!\); break;
}
{ }
printf(\,p->student.studentID); printf(\,p->student.studentName); printf(\,p->student.studentSex); { }
printf(\);
DisplayNode(p->next);
inti=0;
for(i=0;i<4;i++) { }
printf(\,p->student.score[i]); return;
voidDeleteMemory(structlink*head) {
structlink*p=head,*pr=NULL; while(p!=NULL) {
pr=p;
}
}
p=p->next; free(pr);
voidInsertNodeNumber(longlongstudentID,charstudentName[10],charstudentSex[4],intscore[4]) {
structlink*pr=head1,*p=head1,*temp=NULL; p=(structlink*)malloc(sizeof(structlink)); if(p==NULL) { }
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];
printf(\内存申请失败\); return;