链表使用典型例题

p->ave=(p->computer+p->english+p->math)/3;
printf("%6.1f\n",p->ave);
p=p->next;
}while(p!=NULL);
}//输出模块
struct Student*insert()
{
struct Student*pt;
printf("%6d\n",pmax->bian);
}
if(x==4)
{
do
{
if(pmax->english<p1->english)
pmax=p1;
p1=p1->next;
}while(p1!=NULL);
printf("%6d\n",pmax->bian);
t=t+p1->english;
n=n+p1->math;
p1=p1->next;
}while(p1!=NULL);
printf("%24.1f%6.1f%6.1f\n",s/num,t/num,n/num);
}
//求最大值
void ma(struct Student*head,int x)//第二个参数表示要求最大值的数据所在的列编号
head=s;
return head;
}
p=head;
while(p->next!=NULL)
{
if(s->english<p->english&&s->english>p->next->english)
{
s->next=p->next;
}
if(x==5)
{
do
{
if(pmax->math<p1->math)
pmax=p1;
head=s;
return head;
}
p=head;
while(p->next!=NULL)
{
if(s->computer<p->computer&&s->computer>p->next->computer)
{
s->next=p->next;
}
p2->next=NULL;
return(head);
}
void print(struct Student*head)
{
struct Student*p;
p=head;
if(head!=NULL)
do
{
printf("%6s%6d%6ld%6.1f%6.1f%6.1f",p->name,p->bian,p->xue,p->computer,p->english,p->math);
float english;
float math;
float ave;
struct Student*next;
};
struct Student*creat()//创建数据
{
struct Student*head;
struct Student*p1,*p2;
num=0;
{
num=num+1;
if(num==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct Student*)malloc(N);
scanf("%s%d%ld%f%f%f",&p1->name,&p1->bian,&p1->xue,&p1->computer,&p1->english,&p1->math);
while(p->next!=NULL)
{
if(s->ave<p->ave&&s->ave>p->next->ave)
{
s->next=p->next;
p->next=s;
return head;
}
else
p=p->next;
{
struct Student*p1,*pmax;
pmax=head;
p1=head->next;
if(x==3)
{
do
{
if(pmax->computer<p1->computer)
pmax=p1;
p1=p1->next;
}while(p1!=NULL);
{
struct Student*p=NULL;
if(head==NULL)
{
head=s;
head->next=NULL;
return head;
}
if(head->english<s->english)
{
s->next=head;
p1=p1->next;
p1->next=p2->next;
}
return head;
num--;
//在模块中，若存在该学生，必须改变num的值
}
struct Student*get_front(struct Student **head)
{
struct Student *p=0;
p->next=s;
return head;
}
else
p=p->next;
}
p->next=s;
s->next=NULL;
return head;
}
struct Student*english(struct Student*head)
p=sortaverage(p,q);
}
return p;
}
//求平均值，并在其中输出
void average(struct Student*head)
{
float s=0,t=0,n=0;
struct Student*p1;
p1=head;
do{
s=s+p1->computer;
return head;
}
p=head;
while(p->next!=NULL)
{
if(s->math<p->math&&s->math>p->next->math)
{
s->next=p->next;
p->next=s;
return head;
{
struct Student*p=NULL;
if(head==NULL)
{
head=s;
head->next=NULL;
return head;
}
if(head->computer<s->computer)
{
s->next=head;
pt=creat();
return(pt);
}
struct Student*find(struct Student*head, long x)
{
struct Student*p1;
p1=head;
do
{
if(p1->xue==x)
break;
p1=p1->next;
}
else
p=p->next;
}
p->next=s;
s->next=NULL;
return head;
}
struct Student*math(struct Student*head)
{
struct Student*p=0,*q=0;
while(head!=NULL)
if(*head==NULL) return NULL;
else
{
p=*head;
*head=(*head)->next;
return p;
} ห้องสมุดไป่ตู้
}
//排序函数：按英语，并在其中输出
struct Student*sortenglish(struct Student*head,struct Student*s)
#include<stdio.h>
#include<stdlib.h>
#define N sizeof(struct Student)
int num;
struct Student
{
char name[10];
int bian;
long xue;
float computer;
{
struct Student*p=0,*q=0;
while(head!=NULL)
{