学生宿舍管理系统C++

cout<<"姓名:"; cin>>stu.elem[i].name;
cout<<"学号:"; cin>>stu.elem[i].studentnum;
cout<<"房间号:"; cin>>stu.elem[i].roomnum;
}
SelectSortid( stu );
}
p->info.roomnum=stu.elem[i].roomnum;
p->next=num[a].next;
num[a].next=p;
}
}
void Namefind(stulist stu,node num[27],char na[20]) //按姓名查找
{
}
void display(stulist &stu,int n)
{
cout<<"学生姓名"<<" "<<"学号"<<" "<<"房间号"<<endl;
for(int i=1;i<=n;i++)
cout<<stu.elem[i].name<<" "<<stu.elem[i].studentnum<<" "<<stu.elem[i].roomnum<<endl;
if ( stu.elem[j].roomnum <stu.elem[k].roomnum ) k = j;
if ( i != k ) // 与第 i 个记录交换
{
student t;
t = stu.elem[i];
stu.elem[i] = stu.elem[k];
{
student t;
t=stu.elem[i];
stu.elem[i]=stu.elem[k];
stu.elem[k]=t;
}
}
}
}
void SelectSortroom ( stulist stu) //按房间号选择排序
high=mid-1;
else
low=mid+1;
}
return 0;
}
void CreathHash(stulist stu,node num[27]) //建哈希表（链地址法解决冲突）
{
for(int i=1;i<=26;i++)
num[i].next=NULL;
if(num==stu.elem[mid].studentnum)
return mid;
else if(num<stu.elem[mid].studentnum)
high=mid-1;
else
low=mid+1;
}
return 0;
}
int Roomcheck(stulist stu,int roomnum) //按房间号查找
if(i<1||i>8)
{
cout<<"输入有误，请重新输入:";
cin>>i;
}
else
{
switch(i)
{
case 1:inint(stu);break;
case 2:Deleinfo(stu);break;
case 3:Modifyinfo(stu);break;
{
int i,j,k;
for ( i = 1; i < stu.length; ++i ) // 选择第i个小的记录，并交换到位
{
k = i;
for ( j = i+1; j <=stu.length; ++j ) // 在 L.r[i..length] 中选择 id 最小的记录
return;
}
else
p=p->next;
}
}
cout<<"没有该学生!"<<endl;
}
void Deleinfo(stulist stu) //删除信息
{
cout<<"请输入您要删除的学生的房间号:";
int room;cin>>room;
case 6:
cout<<"请输入您要查找的学生的房间号:";
int roomnum;cin>>roomnum;
if(Roomcheck(stu,roomnum))
{
int k=Roomcheck(stu,roomnum);
output(stu,k);
stu.elem[k] = t;
}
}
}
void inint(stulist& stu)
{
cout<<"请输入学生数目:";cin>>stu.length;
for(int i=1;i<=stu.length;i++)
{
cout<<"请输入第"<<i<<"个学生信息:"<<endl;
cout<<"姓名:"; cin>>stu.elem[i].name;
cout<<"学号:"; cin>>stu.elem[i].studentnum;
cout<<"房间号:"; cin>>stu.elemSortroom(stu);
{
int k;
for(int i=0;i<stu.length;i++)
{
k=i;
for(int j=i+1;j<stu.length+1;j++)
{
if(stu.elem[j].studentnum<stu.elem[k].studentnum)k=j;
if(i!=k)
case 4:
node num[27];
cout<<"请输入您要查找的学生的姓名:";
char na[20];cin>>na;
Namefind(stu,num,na);break;
case 5:
cout<<"请输入您要查找的学生的学号:";
CreathHash(stu,num);
for(int i=1;i<=26;i++)
{
node *p=num[i].next;
while(p!=NULL)
{
if(strcmp(p->,na)==0)
{
cout<<"该用户的信息为:"<<endl;
if(!Roomcheck(stu,room))
cout<<"没有该学生!"<<endl;
else
{
int a=Roomcheck(stu,room);
for(int i=stu.length;i>0;i--)//后序遍历，边遍历边移动
{
if(stu.elem[i].roomnum==room)
{
int low=1,high=stu.length;
while(low<=high)
{
int mid=(low+high)/2;
if(roomnum==stu.elem[mid].roomnum)
return mid;
else if(roomnum<stu.elem[mid].roomnum)
}
void main()
{
stulist stu;
stu.elem=(student *)malloc(10000*sizeof(student));
stu.length=0;
cout<<"********宿舍管理查询软件********"<<endl;
cout<<"1.增加信息 2.删除信息"<<endl;
int Idcheck(stulist stu,int num) //按学号查找(若找到则返回位置，否则返回0)(折半查找）
{
SelectSortid ( stu);
int low=1,high=stu.length;
while(low<=high)
{
int mid=(low+high)/2;
for(i=1;i<=stu.length;i++)
{
int a=stu.elem[i].name[0]-96;
node *p=(node *)malloc(sizeof(node));
strcpy(p->,stu.elem[i].name);