宿舍管理系统.docVIP

#includestdio.h

#includestdlib.h

#includestring.h

#defineOK1

#defineError0

#defineN20

#defineNULL0

intn=5;

//链表实现数据的存储

typedefstructSNode

{charname[N];

charnum[N];

charhouse[N];

structSNode*next;

}SNode,*student;

//初始化，创建信息

intinitStudent(students,intn)

{studentp,q;

if(!(s=(student)malloc(sizeof(SNode))))returnError;

p=s;

for(inti=1;i=n;i++)

{q=(student)malloc(sizeof(SNode));

scanf(%s%s%s,q-name,q-num,q-house);

p-next=q;p=q;

}

p-next=NULL;returnOK;

}

//将初始文件内容读出到链表中

voidinitNum(students)

{ s=(student)malloc(sizeof(SNode));

FILE*fp;

studentq,p;p=s;

if((fp=fopen(inData.txt,r))==NULL)

{printf(文件打开错误!\n);

exit(1);

}

while(!feof(fp))

{q=(student)malloc(sizeof(SNode));

fscanf(fp,%s%s%s,q-name,q-num,q-house);

p-next=q;p=q;

}

p-next=0;

fclose(fp);

}

//将信息写入文件

voidwriteDat(students,intn,charflag[])

{FILE*fp;

inti;

studentq;

q=s-next;

if((fp=fopen(inData.txt,a))==NULL)

{printf(文件打开错误!\n);

exit(1);

}

fprintf(fp,\n\n);

for(i=0;in;i++)

{ if(i==0)fprintf(fp,%s%s%s,q-name,q-num,q-house);

elsefprintf(fp,\n%s%s%s,q-name,q-num,q-house);

q=q-next;

}

fclose(fp);

}

//对信息排序

intsortStudent(students)

{studentp,q,r,l;p=s;

while(p-next)

{q=s-next;

while(q-next)

{r=q-next;

if(strcmp(q-num,r-num)0)

{l=s;

while(l-next!=q)l=l-next;

l-next=r;q-next=r-next;

r-next=q;

}

elseq=q-next;

}

p=p-next;

}returnOK;

}

//输出信息

intprintStudent(students)

{studentp;

inti=1;

printf([姓名\t\t学号\t\t寝室号]\n);

p=s-next;

while(p)

{printf(%-18s%-18s%-18s\n,p-name,p-num,p-house);

p=p-next;

}

printf(\n);

returnOK;

}

//二分查找

intsearchStudent(students,chara[])

{inti=1,low=1,high=n,mid,f=0;

char*found;studentp;

p=s-next;

while(low=high)

{mid=(h