《学生管理系统代码.doc》由会员分享，可在线阅读，更多相关《学生管理系统代码.doc（6页珍藏版）》请在金锄头文库上搜索。
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,&p1-xh); while(p1-xh!=0) printf(姓名:); scanf(%s,&p1-xm); printf(性别:); scanf(%s,&p1-sex); printf(班级:); scanf(%d,&p1-bj); printf(出生日期:); scanf(%s,&p1-date); printf(总分:); scanf(%d,&p1-cj); p1=(struct student *)malloc(sizeof(struct student); p2-next=p1; p2=p1; pr
3、intf(请输入学生编号:); scanf(%d,&p1-xh); p2-next=NULL; return 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);
4、fprintf(fp,%dn,p-date); fprintf(fp,%dn,p-cj); p=p-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)
5、 i=t-xh; t-xh=f-xh; f-xh=i; strcpy(ch,t-xm); strcpy(t-xm,f-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
6、 %d %d %s %sn,p-xh,p-xm,p-bj,p-cj,p-date,p-sex); printf(排序成功！); void insert(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
7、=s; void deletexs()int xh;printf(n请输入要删除的数据:);scanf(%d,&xh);p=head;while(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 stude
8、nt *head); while(-1) printf( *n); printf( 1-查询 n); printf( 2-排序 n); printf( 3-插入 n); printf( 4-删除 n); printf( 5-退出 n); printf( *n); printf(请选择：);scanf(%d,&i);switch(i)case 1: printf(*n); printf( 1-按学号查询 n); printf( 2-按姓名查询 n); printf( 3-按成绩查询 n); printf(*n); printf(请输入查找方式:); choose=getche(); switch
9、(choose) case1: printf(请输入学号:);scanf(%d,&xh); for(p=head;p-next!=NULL;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,&xm); 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-
10、cj,p-date,p-sex); break; */ case3: printf(请输入成绩:); scanf(%d,&cj); for(p=head;p-next!=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,&xh,&xm,&bj,&sex,&date,&cj);void insert(struct student *head,int xh,char xm,int bj,char sex,char date,int c
