C++实现简单的学生管理系统
//Student.cpp
#includeusing namespace std; struct Stu { char no[10]; char name[16]; int math; int chi; double ave; }; class Student { public: Stu st; Student * next; public: Student(){} Student(Stu s) { st=s; next=NULL; st.ave=(st.math+st.chi)/2.0; } void setst(Stu s) { st=s; st.ave=(st.math+st.chi)/2.0; } Stu getst() { return st; } void show() { cout<<"----------------------------"< //main.cpp
#include#include"Student.cpp" using namespace std; Student * create_List(); void traverse_List(Student * pHead); bool is_empty(Student * pHead); int length_List(Student * pHead); bool insert_List(Student * pHead,int position,Stu st); bool delete_List(Student * pHead,int position,Stu * st); void sort_List(Student * pHead); void menu_select(); void handle_menu(int s); void outFile(); Student * inFile(); void delFile(); Student * pHead; void main() { menu_select(); } void menu_select() { int s; cout<<"请输入您要操作的选项:"< >s; handle_menu(s); } void handle_menu(int s) { switch (s) { case 1: { system("cls"); pHead=create_List(); system("cls"); menu_select(); break; } case 2: { if(NULL==pHead) { cout<<"记录总条数为零"< >num; cout<<"编辑要插入的记录:"< >st.no; cout<<"姓名:"; cin>>st.name; cout<<"数学成绩:"; cin>>st.math; cout<<"语文成绩:"; cin>>st.chi; if(insert_List(pHead,num-1,st)) { cout<<"插入成功!"< >num; if(delete_List(pHead,num,st)) { cout< no< name< next=NULL; ifstream in("c:\kcsj.txt"); if (!in.is_open()) { cout << "Error opening file"< (&st), sizeof(st)); if (in.fail()) { break; } Student * pNew=new Student(); if(NULL==pNew) { printf("分配失败,程序终止n"); exit(0); } pNew->setst(st); pTail->next=pNew; pNew->next=NULL; pTail=pNew; } in.close(); return pHead; } void outFile() { ofstream out; out.open("c:\kcsj.txt",ios_base::out|ios_base::app|ios::binary); if(!out) { cout<<"文件不存在,退出时别忘记保存文件!"< next; while(temp!=NULL) { Stu st=temp->getst(); out.write(reinterpret_cast (&st), sizeof(st)); temp=temp->next; } out.close(); } Student * create_List() { int len; Student * pHead=(Student *)malloc(sizeof(Student)); if(NULL==pHead) { cout<<"分配失败,程序终止!"< next=NULL; cout<<"请输入要存储的学生人数:"; cin>>len; for(int i=0;i >st.no; cout<<"请输入第"<>st.name; cout<<"请输入第"<>st.math; cout<<"请输入第"<>st.chi; Student * pNew=new Student(); if(NULL==pNew) { printf("分配失败,程序终止n"); exit(0); } pNew->setst(st); pTail->next=pNew; pNew->next=NULL; pTail=pNew; } return pHead; } void traverse_List(Student * pHead) { int i=1; Student * temp=pHead->next; while(temp!=NULL) { cout< show(); temp=temp->next; i++; } } bool is_empty(Student * pHead) { if(NULL==pHead->next) { return true; } else { return false; } } int length_List(Student * pHead) { int len=0; Student * temp=pHead->next; while(temp) { len++; temp=temp->next; } return len; } bool insert_List(Student * pHead,int position,Stu st) { int i=0; Student * p=pHead; while(NULL!=p&&i next; i++; } if(i>position-i||NULL==p) { return false; } Student * pNew=(Student *)malloc(sizeof(Student)); if(NULL==pNew) { cout<<"分配失败,程序终止"< setst(st); pNew->next=p->next; p->next=pNew; return true; } bool delete_List(Student * pHead,int position,Stu * st) { int i=0; Student * p=pHead; while(NULL!=p->next&&i next; i++; } Student * q=p->next; *st=q->getst(); p->next=p->next->next; free(q); q=NULL; return true; } void sort_List(Student * pHead) { Student * p,* q; Stu temp; int i,j; int len=length_List(pHead); for(i=0,p=pHead->next;i next) { for(j=i+1,q=p->next;j next) { if(q->st.ave>p->st.ave) { temp=q->st; q->st=p->st; p->st=temp; } } } } 以上所述就是本文的全部内容了,希望大家能够喜欢。



