数据结构实验三顺序表学生信息

#include<iostream.h>
class Student
{private:
char name[2000];
int number;
int score;
char sex[2000];
public:
static int count;
void Insert(){
          cout<<"请输入你的名字:";cin>>name;
              cout<<"请输入你的学号:";cin>>number;
  cout<<"请输入你的性别:";cin>>sex;
  cout<<"请输入你的分数:";cin>>score;
                  count++;
  cout<<"有效输入数据数目:"<<count<<endl;}
void Search(){cout<<"你的名字:";cout<<name<<endl;
              cout<<"你的学号:";cout<<number<<endl;
  cout<<"你的性别:";cout<<sex<<endl;
  cout<<"你的分数:";cout<<score<<endl;}
void Show(){
          cout<<"你的名字:"<<name<<endl;
              cout<<"你的学号:"<<number<<endl;
  cout<<"你的性别:"<<sex<<endl;
  cout<<"你的分数:"<<score<<endl;}
void Recompose(){cout<<"请输入你修改后的名字:";cin>>name;
              cout<<"请输入你修改后的性别:";cin>>sex;
  cout<<"请输入你修改后的学号:";cin>>number;
  cout<<"请输入你修改后的分数:";cin>>score;}
};
int Student::count=0;
int main()
{Student array[100];
int i;void menu();
do{menu();cout<<"请输入你的选择:";cin>>i;
switch(i)
{case 1:int k;int n;cout<<"请输入你要输入的数据数目:";cin>>n;
for(k=0;k<n;k++){cout<<"该数据编号为:"<<Student::count+1<<endl;array[Student::count].Insert();}break;
case 3:int x;cout<<"请输入你要查找的数据编号:";cin>>x;if(x-1<Student::count)array[x-1].Search();else cout<<"没有该数据!"<<endl;break;
case 4:int j;for(j=0;j<Student.count;j++){cout<<"数据编号:"<<j+1<<endl;array[j].Show();}break;
 case 2:int y;cout<<"请输入你要修改的数据编号:";cin>>y;array[y-1].Recompose();break;
 case 5:break;
 default:cout<<"输入错误!"<<endl;cout<<"请重新输入:";break;
}}while(i!=5);
return 0;
}
void menu()
{
cout<<"******插入-----1"<<endl;
cout<<"******修改-----2"<<endl;
cout<<"******查找-----3"<<endl;
cout<<"******显示-----4"<<endl;
cout<<"******退出-----5"<<endl;}

猜你喜欢

转载自blog.csdn.net/guangnianaaa/article/details/80247189