C语言之学生管理系统.doc

流程图：运行结果：程序源码：#include #include #include #include #include #define LEN sizeof(struct student)/求字节数运算符 struct student char name20; long int num; char sex4; int age; char address30; float score; struct student *next;/链表 ;/定义一个结构题 int TOTAL_NUM = 0;/学生总数 struct student *head = NULL; void mainmenu ();/主界面 void record (); /记录数据 void insert(struct student *stu); /插入数据 void display(struct student *stu); /显示一个学生的信息 void displayAll (); /显示所有学生的信息 void query(); /查询学生信息 void query_by_num(); /按学号查询学生信息 void query_by_name(); void readData (); /读取文件里学生的信息 void writeData (); /向文件写入学生信息 void freeAll (); /清空链表内容 void del (); /删除学生信息 void change (); /更改学生信息 void sort();/排序 void devise (struct student *p); /选择更改内容 int main (void) mainmenu (); return 0; /系统主菜单 void mainmenu () int choice; choice = -1; readData (); printf (ttt-n); printf (ttt| 欢迎使用通信工程专业学生信息管理系统 |n); printf (ttt-n); printf (ttt本程序需要在当前目录下建立student.txt才可正常运行n); do printf (nnn); printf (ttt-n); printf (ttt通信工程专业学生信息管理系统 |n); printf (ttt-n); printf (ttt1-录入学生信息 |n); printf (ttt2-浏览学生信息 |n); printf (ttt3-查询学生信息 |n); printf (ttt4-删除学生信息 |n); printf (ttt5-修改学生信息 |n); printf (ttt6-排序 |n); printf (ttt0-退出系统 |n); printf (ttt-n); printf (请输入您的选择); scanf (%d, &choice); switch (choice) case 0:writeData ();freeAll (); exit (0); case 1:record ();break; case 2:displayAll ();break; case 3:query ();break; case 4:del ();break; case 5:change ();break; case 6:sort ();break; default:printf (n无效选项!);break; while (choice != 0); /录入学生信息 void record () struct student *p0; p0 = (struct student *)malloc(LEN); printf (ttt请输入学生的姓名:); scanf (%s,p0-name); printf (ttt请输入学生的学号:); scanf (%ld,&p0-num); printf (ttt请输入学生的性别:); scanf (%s,p0-sex); printf (ttt请输入学生的年龄:); scanf (%d,&p0-age); printf (ttt请输入学生的地址:); scanf (%s,p0-address); printf (ttt请输入学生的成绩:); scanf (%f,&p0-score); insert (p0); printf (ttt该学生的信息为:n); printf (ttt-n); printf (ttt姓名t学号tt年龄t性别t地址tt成绩n); display (p0); void insert (struct student *stu) struct student *p0, *p1, *p2; p1 = head; p0 = stu; if (head = NULL) head = p0; p0-next = NULL; else while (p0-num p1-num)&(p1-next != NULL) p2 = p1;p1 = p1-next; if (p0-num num) if (head = p1) head = p0; else p2-next = p0; p0-next = p1; else p1-next = p0; p0-next = NULL; TOTAL_NUM+; void display (struct student *p) printf (ttt%st%ldtt%dt%st%stt%fn, p-name, p-num, p-age, p-sex,p-address, p-score); /浏览学生信息 void displayAll() struct student *p; printf(ttt学生总数:%dn, TOTAL_NUM); p = head; if (head != NULL) printf(ttt姓名t学号tt年龄t性别t地址tt成绩n); printf(ttt-n); do display(p); p = p-next; while(p != NULL); printf (n); void query() int choice; choice = -1; do printf(n); printf(-n); printf(| 按学号查询 请按 1 |n); printf(| 按姓名查询 请按 2 |n); printf(| 取消 请按 0 |n); printf(+-+n); printf(请输入您的选择); scanf(%d, &choice); switch(choice) case 0:return; case 1:query_by_num();break; case 2:query_by_name();break; default:printf(n无效选项!);break; while(choice != 0); /按姓名查询学生信息 void query_by_name() char name20; struct student *p1; printf(请输入学生的姓名); scanf(%s, name); if(head=NULL) printf(无学生记录n); return; p1=head; while(strcmp(name, p1-name) & p1-next!=NULL) p1=p1-next; if(!strcmp(name, p1-name) printf(ttt姓名t学号tt年龄t性别t地址tt成绩n); printf(ttt-n); display(p1); else printf(没有该学生记录 请核对); /按学号查询学生信息 void query_by_num () int num; struct student *p1; printf(请输入学生的学号); scanf(%ld, &num); if(head=NULL) printf(无学生记录n); return; p1 = head; while (num!=p1-num & p1-next!=NULL) p1 = p1-next; if (num = p1-num) printf (ttt姓名t学号tt年龄t性别t地址tt成绩n); printf (ttt-n); display (p1); else printf (ttt没有该学生记录请核对); /写入文件 void writeData () FILE* fp;/文件指针 struct student *p; fp = fopen(1.txt, w); if (!fp) printf(文件打开错误); return; fprintf(fp,%dn, TOTAL_NUM); for(p = head; p!= NULL; p= p-next) fprintf(fp,%st%ldt%st%dt%st%fn, p-name, p-num, p-sex, p-age, p-address, p-score); fclose (fp); void freeAll () struct student *p1, *p2; p1 = p2=head; while(p1) p2=p1-next; free (p1); p1 = p2; /读取文件 void readData () FILE* fp;/文件指针 struct student *p1, *p2; fp = fopen(student.txt, r); if (!fp) printf(文件打开错误); return; fscanf(fp,%dn, &TOTAL_NUM); head = p1 = p2 = (struct student *)malloc(LEN); fscanf(fp,%st%ldt%st%dt%st%fn, p1-name, &p1-num, p1-sex,&p1-age, p1-address, &p1-score); while(!feof(fp) p1 = (struct student *)malloc(LEN); fscanf(fp,%st%ldt%st%dt%st%fn, p1-name, &p1-num, p1-sex, &p1-age, p1-address, &p1-score); p2-next = p1; p2 = p1; p2-next = NULL; fclose(fp); /删除学生信息 void del () struct student *p1, *p2; long int num; if (head = NULL) printf(无学生记录n); return; printf(请输入您要删除的学生的学号); scanf(%ld, &num); p1 = head; while (num != p1-num & p1-next != NULL) p2 = p1; p1 = p1-next; if(num = p1-num) if(p1 = head) head = p1-next; else p2-next = p1-next; free(p1); TOTAL_NUM-; else printf(没有该学生记录请核对n); void sort() /排序模块。将学生记录按学号从小到大排列。用起泡排序算法实现 int i; struct student *ptr,*s=head,*p; int count=0,count1; while(s)/统计链表结点个数 count+; s=s-next; for( i=1;inext&(count1-) if(ptr-scoreptr-next-score) s=ptr-next; ptr-next=s-next; if(p=NULL) /ptr处于队头时 head=s; else p-next=s; s-next=ptr; p=s; else ptr=ptr-next; if(p=NULL) /ptr处于队头时 p=head; else p=p-next; displayAll (); return; void change () struct student *p1, *p2; long int num; if (head = NULL) printf (无学生记录n); return; printf (请输入您要修改的学生的学号); scanf (%ld, &num); p1 = head; while (num != p1-num & p1-next != NULL) p2 = p1;p1 = p1-next; if(num = p1-num) devise (p1); else printf(没有该学生记录请核对n); void devise (struct student *p) int choice; choice = -1; do printf(请选择您要修改的学生的