毕琪

```c
#include
#include
#include
#define MAXSIZE 100
typedef struct {
int cardNum;
char name[8];
char major[10];
int classNum;
}libCardInfo;
typedef struct{
libCardInfo cardInfo;
}recordInfo;
typedef struct{
recordInfo r[MAXSIZE + 1];
int length;
}table;
void input(table *tab)
{
char s = 'Y';
tab->length = 1;
while (s == 'Y' || s == 'y'&&tab->length <= MAXSIZE){
printf("\n请输入借书证卡号：");
scanf("%d", &tab->r[tab->length].cardInfo.cardNum);
printf("请输入持卡人姓名：");
scanf("%s", tab->r[tab->length].cardInfo.name);
printf("请输入持卡人专业：");
scanf("%s", tab->r[tab->length].cardInfo.major);
printf("请输入持卡人班号：");
scanf("%d", &tab->r[tab->length].cardInfo.classNum);
printf("请问是否继续录入？（Y/N）:");
getchar();
scanf("%c", &s);
tab->length++;
}
}
void output(libCardInfo *info)
{
printf("\t 借书证卡号：%d\n", info->cardNum);
printf("\t 持卡人姓名：%s\n", info->name);
printf("\t 持卡人专业：%s\n", info->major);
printf("\t 持卡人班号：%d\n", info->classNum);
printf("\n");
}
void shellinsertsort(table *tab){
int i, j, d;
d = tab->length / 2;
while (d >= 1){
for (i = d + 1; ilength; i++)
{
tab->r[0] = tab->r[i];
j = i - d;
while (j>0 && tab->r[0].cardInfo.cardNumr[j].cardInfo.cardNum)
{
tab->r[j + d] = tab->r[j];
j = j - d;
}
tab->r[j + d] = tab->r[0];
}
d = d / 2;
}
for (i = 1; ilength; i++)
{
output(&tab->r[i].cardInfo);
}
}
void seqSearch(table *tab){
int i = 1, j = 1;
char major[10];
printf("\n请输入你要查找的专业：");
scanf("%s", major);
while (ilength){
if (!strcmp(tab->r[i].cardInfo.major, major)){
output(&(tab->r[i].cardInfo));
j = 0;
}
i++;
}
if (j) printf("\t\t 『没有该专业的记录！』\n");
}
int main() {
int x, set = 1;
table tab;
while (set){
printf("\t\t 欢迎使用借书证管理系统\n");
printf("\t\t 1.录入借书证基本信息 \n");
printf("\t\t 2.输出已有借书证信息 \n");
printf("\t\t 3.专业查找借书证信息 \n");
printf("\t\t 4.退出借书证管理系统 \n");
printf("请按你的需求选择操作：");
scanf("%d", &x);
switch (x)
{
case 1:input(&tab); break;
case 2:shellinsertsort(&tab); break;
case 3:seqSearch(&tab); break;
case 4:set = 0; printf("\t\t\t『系统退出成功！』\n"); break;
default: printf("没有该选项对应的操作！");
}
}
return 0;
}
```