今天完成了学生管理系统的升级版2.0。
与1.0的不同点:
(一):使用链表来缓存学生信息。
(二):加入了姓名查找,学号查找,成绩排序功能。
(三):采用多文件编程。
缺陷
(一):依然有代码复用问题。
(二):缺少增加信息,删除信息,更改信息功能。
下面又到了贴代码的时刻了。
main.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "Student_system.h"
int main() {
int n;
stu *head;
stu *head1;
head=(stu*)malloc(sizeof(stu));
head->next=NULL;
head1=(stu*)malloc(sizeof(stu));
head1->next=NULL;
while(1)
{
printf("*******student system*******\n");
printf("\t1.Append record\n");
printf("\t2.Caculate total and average score of every student\n");
printf("\t3.Sort in ascending order by total score of every student\n");
printf("\t4.Sort in dictionary order by name\n");
printf("\t5.Search by number\n");
printf("\t6.Search by name\n");
printf("\t7.Write in file\n");
printf("\t8.Read from a file\n");
printf("\t0.Eixt\n\n");
printf("Please enter your choice:");
scanf("%d",&n);
if(n==0)
exit(1);
switch(n)
{
case 1:Append_record(head);
break;
case 2:Caculate_score(head);
break;
case 3:Sort_total_score(head);output(head);
break;
case 4:Sort_by_name(head);
break;
case 5:Search_by_number(head);
break;
case 6:Search_by_name(head);
break;
case 7:Write_to_file(head);
break;
case 8:Read_from_file(head1);
break;
}
}
return 0;
}
Student_system.h
#ifndef STUDENT_SYSTEM_STUDENT_SYSTEM_H
#define STUDENT_SYSTEM_STUDENT_SYSTEM_H
#endif //STUDENT_SYSTEM_STUDENT_SYSTEM_H
#include <stdio.h>
#include <stdlib.h>
typedef struct student{
int num;
char name[20];
double MT;
double EN;
double PH;
double sum;
double ave;
struct student *next;
}stu;
extern void Append_record(stu *head);
extern void Caculate_score(stu *head);
extern void Sort_total_score(stu *head);
extern void Sort_by_name(stu *head);
extern void Search_by_number(stu *head);
extern void Search_by_name(stu *head);
extern void Write_to_file(stu *head);
extern void Read_from_file(stu *head1);
extern void output(stu *head);
extern int find_stu_sum(stu *head);
Student_system.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "Student_system.h"
int stu_sum;
int ming_ci;
void Append_record(stu *head)
{
stu_sum=0;
stu *p,*r;
int num;
char name[20];
double MT;
double EN;
double PH;
double sum;
double ave;
r=head;
printf("please enter student infomation under the line:\n");
while(scanf("%d",&num)!=NULL&&num!=0)
{
stu_sum++;
scanf("%s",name);
scanf("%lf",&MT);
scanf("%lf",&EN);
scanf("%lf",&PH);
p=(stu*)malloc(sizeof(stu));
p->num=num;
strcpy(p->name,name);
p->MT=MT;
p->EN=EN;
p->PH=PH;
r->next=p;
r=p;
}
r->next=NULL;
stu_sum=find_stu_sum(head);
//printf("%d\n",stu_sum);
//output(head);
}
void Caculate_score(stu *head)
{
stu *p;
double sum;
double ave;
p=head->next;
while(p!=NULL)
{
sum=p->MT+p->EN+p->PH;
ave=sum/3;
p->sum=sum;
p->ave=ave;
p=p->next;
}
//printf("%d\n",stu_sum);
//output(head);
}
void Sort_total_score(stu *head) {
stu *p,*q;
int t;
char name[20];
double MT;
double EN;
double PH;
double sum;
double ave;
for (p = head; p != NULL; p = p->next)
{
for (q = p->next; q != NULL; q = q->next)
{
if (p->sum > q->sum)
{
t = q->num;
q->num = p->num;
p->num = t;
strcpy(name,p->name);
strcpy(p->name,q->name);
strcpy(q->name,name);
MT=p->MT;
p->MT=q->MT;
q->MT=MT;
EN=p->EN;
p->EN=q->EN;
q->EN=EN;
PH=p->PH;
p->PH=q->PH;
q->PH=PH;
sum=p->sum;
p->sum=q->sum;
q->sum=sum;
ave=p->ave;
p->ave=q->ave;
q->ave=ave;
}
}
}
//output(head);
}
void Sort_by_name(stu *head)
{
stu *p,*q;
int t;
char name[20];
double MT;
double EN;
double PH;
double sum;
double ave;
for (p = head; p != NULL; p = p->next)
{
for (q = p->next; q != NULL; q = q->next)
{
if (strcmp(p->name,q->name)>0)
{
t = q->num;
q->num = p->num;
p->num = t;
strcpy(name,p->name);
strcpy(p->name,q->name);
strcpy(q->name,name);
MT=p->MT;
p->MT=q->MT;
q->MT=MT;
EN=p->EN;
p->EN=q->EN;
q->EN=EN;
PH=p->PH;
p->PH=q->PH;
q->PH=PH;
sum=p->sum;
p->sum=q->sum;
q->sum=sum;
ave=p->ave;
p->ave=q->ave;
q->ave=ave;
}
}
}
output(head);
}
void Search_by_number(stu *head)
{
ming_ci=0;
int student_number;
stu *p,*q;
int t;
char name[20];
double MT;
double EN;
double PH;
double sum;
double ave;
for (p = head; p != NULL; p = p->next)
{
for (q = p->next; q != NULL; q = q->next)
{
if (p->sum > q->sum)
{
t = q->num;
q->num = p->num;
p->num = t;
strcpy(name,p->name);
strcpy(p->name,q->name);
strcpy(q->name,name);
MT=p->MT;
p->MT=q->MT;
q->MT=MT;
EN=p->EN;
p->EN=q->EN;
q->EN=EN;
PH=p->PH;
p->PH=q->PH;
q->PH=PH;
sum=p->sum;
p->sum=q->sum;
q->sum=sum;
ave=p->ave;
p->ave=q->ave;
q->ave=ave;
}
}
}
printf("please enter the student's number:");
scanf("%d",&student_number);
for (p = head; p != NULL; p = p->next)
{
if(p->num==student_number)
{
printf("名次:");
printf("%d ",stu_sum-ming_ci+1);
printf("成绩:");
printf("%.2lf ",p->MT);
printf("%.2lf ",p->EN);
printf("%.2lf ",p->PH);
printf("%.2lf ",p->sum);
printf("%.2lf\n",p->ave);
break;
}
ming_ci++;
}
}
void Search_by_name(stu *head)
{
ming_ci=0;
char student_name[20];
stu *p,*q;
int t;
char name[20];
double MT;
double EN;
double PH;
double sum;
double ave;
for (p = head; p != NULL; p = p->next)
{
for (q = p->next; q != NULL; q = q->next)
{
if (p->sum > q->sum)
{
t = q->num;
q->num = p->num;
p->num = t;
strcpy(name,p->name);
strcpy(p->name,q->name);
strcpy(q->name,name);
MT=p->MT;
p->MT=q->MT;
q->MT=MT;
EN=p->EN;
p->EN=q->EN;
q->EN=EN;
PH=p->PH;
p->PH=q->PH;
q->PH=PH;
sum=p->sum;
p->sum=q->sum;
q->sum=sum;
ave=p->ave;
p->ave=q->ave;
q->ave=ave;
}
}
}
printf("please enter the student's name:");
scanf("%s",student_name);
for (p = head; p != NULL; p = p->next)
{
if(strcmp(p->name,student_name)==0)
{
printf("名次:");
printf("%d ",stu_sum-ming_ci+1);
printf("成绩:");
printf("%.2lf ",p->MT);
printf("%.2lf ",p->EN);
printf("%.2lf ",p->PH);
printf("%.2lf ",p->sum);
printf("%.2lf\n",p->ave);
break;
}
ming_ci++;
}
}
void Write_to_file(stu *head)
{
stu *p;
p=head->next;
FILE *fp;
if((fp=fopen("stu_info.txt","r+"))==NULL)
{
printf("error open.\n");
return;
}
while(p!=NULL)
{
/*
fprintf(fp,"%d",&p->num);
fprintf(fp,"%s",p->name);
fprintf(fp,"%lf",&p->MT);
fprintf(fp,"%lf",&p->EN);
fprintf(fp,"%lf",&p->PH);
fprintf(fp,"%lf",&p->sum);
fprintf(fp,"%lf",&p->ave);
*/
fwrite(p, sizeof(stu),1,fp);
p=p->next;
}
fclose(fp);
}
void Read_from_file(stu *head1)
{
int i;
stu *q;
FILE *fp;
if((fp=fopen("stu_info.txt","r+"))==NULL)
{
printf("error open\n");
return;
}
stu *p,*r;
r=head1;
while(!feof(fp))
{
p=(stu*)malloc(sizeof(stu));
fread(p,sizeof(stu),1,fp);
r->next=p;
r=p;
}
r->next=NULL;
fclose(fp);
q=head1->next;
for(i=0;i<stu_sum;i++)
{
printf("%d ",q->num);
printf("%s ",q->name);
printf("%.2lf ",q->MT);
printf("%.2lf ",q->EN);
printf("%.2lf ",q->PH);
printf("%.2lf ",q->sum);
printf("%.2lf\n",q->ave);
q=q->next;
}
}
void output(stu *head)
{
stu *p;
p=head->next;
while(p!=NULL)
{
printf("%d ",p->num);
printf("%s ",p->name);
printf("%.2lf ",p->MT);
printf("%.2lf ",p->EN);
printf("%.2lf ",p->PH);
printf("%.2lf ",p->sum);
printf("%.2lf\n",p->ave);
p=p->next;
}
}
int find_stu_sum(stu *head)
{
stu *p;
p=head->next;
int i=0;
while(p!=NULL)
{
i++;
p=p->next;
}
return i;
}
至此,学生管理系统2.0就结束了,其中的缺陷,望各位大师不吝赐教。