链表的写入和读出.doc

/*嵌入10103王明方*/#include #include #include #include #define NUM 25typedef struct char name10; int num; double phy; double cham; double sum;stu;typedef struct _stu_ stu data; struct _stu_ *next;_stu;typedef _stu *stul; void getstu (stu *,int);void prinstu (stu *,int );stul createlink (stu *,stul,int);void sortLink(stul head,char key);void input (stul ,stu *);void insert (stul,stul);void printlink(stul);void printlinkToFile(stul head,FILE *fp);void readLinkFromFile(stul head,FILE *fp);void readLinkFromFileB(stul head,FILE *fp);void printlinkToFileB(stul head,FILE *fp);/*main ()*int main(int argc ,char *argcs) stu stusNUM; stul head=NULL; stul cur,s,new; getstu (stus,NUM);/ 调用函数 初始化结构体stusNUM prinstu (stus,NUM);/ 输出学生信息 head=createlink (stus,head,NUM); printf (sort refer to phy :n); sortLink(head,p); printlink(head); printf (sort refer to cham :n); sortLink(head,c); printlink(head); printf (sort refer to sum :n); sortLink(head,s); printlink(head); / 输出链表 /=read and write from links.txt= FILE *fp; char *filename=./links.txt; if(fp=fopen(filename,w+b)=NULL) printf(Cant open file:%s,filename); exit(-1); printf (Write links to file. :n); printlinkToFile(head,fp);/write link to file printf (OK!n); if(fp=fopen(filename,r+b)=NULL) printf(Cant open file:%s,filename); exit(-1); printf (Read links file file. :n); readLinkFromFile(head,fp);/read link from file printf (OK!n); printlink(head); /=/=read and write from linksB.txt= filename=./linksB.txt; if(fp=fopen(filename,w+b)=NULL) printf(Cant open file:%s,filename); exit(-1); printf (Write links to file. :n); printlinkToFileB(head,fp);/write link to file printf (OK!n); printf (read links from file. :n); readLinkFromFileB(head,fp);/write link to file printf (OK!n); printlink(head); /= /*jie gou ti han shu*void getstu(stu *stus,int len) int i; srand(int)time(0); for(i=1;iname,qr); stus-num=i; stus-phy=60+rand()%20; stus-cham=60+rand()%20; stus-sum=stus-phy+stus-cham; stus+; void prinstu (stu *stus,int len) int i; printf(tt =Chenjidan=n); printf(ttNamet chamt phyttsumn); for(i=1;iname,stus-num,stus-cham,stus-phy,stus-phy+stus-cham); stus+; printf(tt =n);/*lian biao han shu*stul createlink(stu *stus,stul head,int len) stul s,p; int i; for (i=0;idata=stusi; if (head=NULL) head=s;head-next=NULL;p=s; else p-next=s; s-next=NULL; p=s; return head;void sortLink(stul head,char key)int n=0;int i,j,change;stul p,q,tl,tr;stu c;p=head;while (p)p=p-next;n+; p=head; while(n-) q=head; j=n; while (j-)tl=q; tr=q-next;change=0;switch(key)case p: if (tl-data.phydata.phy) change=1;break;case c: if (tl-data.chamdata.cham)change=1;break;case s: if (tl-data.sumdata.sum) change=1;break;if (change) c=tl-data;tl-data=tr-data;tr-data=c; q=q-next; void printlink(stul head) int i=1; while(head) printf(name=%s%d creadLinkFromFile(stul head,FILE *fp)ham=%.2lf phy=%.2lf sum=%.0lf-n,,head-data.num,head-data.cham,head-data.phy,head-data.sum); head=head-next; if (i+)%10=0) printf (n); printf(n); void printlinkToFile(stul head,FILE *fp) int i=1; while(head) fprintf(fp,name=%s num=%d cham=%.2lf phy=%.2lf sum=%.0lf-n,,head-data.num,head-data.cham,head-data.phy,head-data.sum); head=head-next; /if (i+)%10=0) void printlinkToFileB(stul head,FILE *fp) int i=1; while(head) fwrite(&head-data,sizeof(head-data),1,fp);/块写入 head=head-next; void readLinkFromFile(stul head,FILE *fp) int i=1; while(head) fscanf(fp,name=%s num=%d cham=%.2lf phy=%.2lf sum=%.0lf-n,,head-data.num,head-data.cham,head