1、#include#include#include#includeusing namespace std;struct studentint xh;char xm20;int bj;char sex20;char date20;int cj;struct student *next;struct student *head,*p,*q,*s;struct student *creat()struct student *p1,*head,*p2;head=p1=p2=(struct student *)malloc(sizeof(struct student);/创建一个节点printf(“=请输
2、入学生信息=n“);printf(“n 请输入学生编号:n“);scanf(“%d“,while(p1-xh!=0)printf(“姓名:“);scanf(“%s“,printf(“性别:“);scanf(“%s“,printf(“班级:“);scanf(“%d“,printf(“出生日期:“);scanf(“%s“,printf(“总分:“);scanf(“%d“,p1=(struct student *)malloc(sizeof(struct student);p2-next=p1;p2=p1;printf(“请输入学生编号:“);scanf(“%d“,p2-next=NULL;retu
3、rn head;void save(struct student *head)/保存链表为磁盘文件FILE *fp;struct student *p;if(fp=fopen(“stu.dat“,“wb“)=NULL)printf(“创建文件失败!n“);return;p=head;while(p!=NULL)fprintf(fp,“%dn“,p-xh);fprintf(fp,“%sn“,p-xm);fprintf(fp,“%dn“,p-bj);fprintf(fp,“%sn“,p-sex);fprintf(fp,“%dn“,p-date);fprintf(fp,“%dn“,p-cj);p=p
4、-next;fputs(“over“,fp);printf(“文件保存成功!n“);fclose(fp);void sort(struct student *head)struct student *p,*f,*t;char ch100;int i;p=f=t=head;for(p=head;p-next!=NULL;p=p-next)/由 P 来控制循环次数for(t=head,f=t-next;t-next!=NULL;t=t-next,f=f-next)if(t-xh)(f-xh) i=t-xh;t-xh=f-xh;f-xh=i;strcpy(ch,t-xm);strcpy(t-xm,f
5、-xm);strcpy(f-xm,ch);strcpy(ch,t-sex);strcpy(t-sex,f-sex);strcpy(f-sex,ch);i=t-bj;t-bj=f-bj;f-bj=i;i=t-cj;t-cj=f-cj;f-cj=i;strcpy(ch,t-date);strcpy(t-date,f-date);strcpy(f-date,ch);for(p=head;p-next!=NULL;p=p-next) printf(“ %d %s %d %d %s %sn“,p-xh,p-xm,p-bj,p-cj,p-date,p-sex);printf(“排序成功！“);void i
6、nsert(struct student *head,int xh,char xm,int bj,char sex,char date,int cj)p=head;s=(struct student*)malloc(sizeof(struct student);s-xh=xh;strcpy(s-xm,xm);s-bj=bj;strcpy(s-sex,sex);strcpy(s-date,date);s-cj=cj;s-next=p-next;p-next=s;void deletexs()int xh;printf(“n 请输入要删除的数据:“);scanf(“%d“,p=head;while
7、(p-next!=NULL)if(p-next-xh!=xh)p=p-next;elseq=p-next;p-next=q-next;free(q);printf(“删除成功n“);void main()int i;char choose;int xh;char xm;int bj;char sex;char date;int cj;struct student *head;head=creat();void save(struct student *head);while(-1)printf(“ *n“);printf(“ 1-查询 n“);printf(“ 2-排序 n“);printf(
8、“ 3-插入 n“);printf(“ 4-删除 n“);printf(“ 5-退出 n“);printf(“ *n“);printf(“请选择：“);scanf(“%d“,switch(i)case 1:printf(“*n“);printf(“ 1-按学号查询 n“); printf(“ 2-按姓名查询 n“);printf(“ 3-按成绩查询 n“);printf(“*n“);printf(“请输入查找方式:“);choose=getche();switch(choose) case1:printf(“请输入学号:“);scanf(“%d“,for(p=head;p-next!=NULL
9、;p=p-next)if(p-xh=xh)printf(“ %d %s %d %d %s %sn“,p-xh,p-xm,p-bj,p-cj,p-date,p-sex);break;/*case2:printf(“请输入姓名:“);scanf(“%s“,for(p=head;p-next!=NULL;p=p-next)if(strcmp(xm,p-xm)=0)printf(“ %d %s %d %d %s %sn“,p-xh,p-xm,p-bj,p-cj,p-date,p-sex);break; */case3:printf(“请输入成绩:“);scanf(“%d“,for(p=head;p-n
10、ext!=NULL;p=p-next)if(p-cj=cj)printf(“ %d %s %d %d %s %sn“,p-xh,p-xm,p-bj,p-cj,p-date,p-sex);break;default:printf(“查无此人!n“);break;case 2:void sort(struct student *head);break;case 3:printf(“请输入要插入学生的信息:n“);scanf(“%d %s %d %d %s“,void insert(struct student *head,int xh,char xm,int bj,char sex,char date,int cj);break;case 4:deletexs();break;case 5:exit(0);default:printf(“请重新输入“);break;
