学生成绩排序和平均分计算利用c语言链表的创建插入删除.docVIP

#includestdio.h #includemalloc.h #define NULL 0 #define LEN sizeof(struct student) struct student { long num; float score; struct student *next; }; int n; struct student *creat(void)//创建链表 { struct student *head; struct student *p1,*p2; n=0; p1=p2=(struct student*)malloc(LEN); scanf(%ld,%f,p1-num,p1-score); head=NULL; while(p1-num!=0) { n=n+1; if(n==1)head=p1; else p2-next=p1; p2=p1; p1=(struct student *)malloc(LEN); scanf(%ld,%f,p1-num,p1-score); } p2-next=NULL; return(head);//带回链表的头指针 } void print(struct student *head)//输出链表 { struct student *p; printf(\nNow,there %d records are:\n,n); p=head; if(head!=NULL) do { printf(%ld %5.1f\n,p-num,p-score); p=p-next; } while(p!=NULL); } void averprintf(struct *head)//平均值输出 { struct student *p; float aver,sum=0,high=0,low=0; long num1; printf(\nNow,the averge score is:\n); p=head; if(head!=NULL) do { sum=sum+p-score; p=p-next; } while(p!=NULL); aver=sum/n;printf(%5.1f\n,aver);} void highprintf(struct student *p)/*求最高分*/ { int high=p-score; long num1=p-num; do {if (highp-score) {high=p-score; num1=p-num;} p=p-next ;}while (p!=NULL); printf(\nThe highest score is:%d,and its number is:%ld\n,high,num1);} void lowprintf(struct student *p)/*求最低分*/ { int low=p-score; long num1=p-num; do{if (lowp-score) {low=p-score; num1=p-num;} p=p-next;}while (p!=NULL); printf(\nThe lowest score is:%d,and its number is:%ld\n,low,num1);} void sort(struct student *head)//学生成绩排序 { struct student *p1,*p2; float i;long t; printf(Students from low to high ranking\n); p1=head; if(head==NULL) { printf(it is blank\n); } else { while(p1!=NULL) { p2=p1-next; while(p2!=NULL) { if(p1-scorep2-score) { i=p2-score; p2-score=p1-score; p1-score=i; t=p2-num; p2-num=p1-num; p1-num=p2-num; } p2=p2-next; } p1=p1-next; } } while(p1!=0) { printf(%ld %5.1f\n,head-num,p1-score); head-next; } }