郑小凡

```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]; //r[0]一般不用于存放排序码
int length; //待排序文件中记录的个数
}table; //待排序文件类型
void input(table *tab){ //录入基本信息
char s = 'Y';
tab->length = 1;
while (s == 'Y' || s == 'y'&&tab->length <= MAXSIZE){
printf("\n请输入借书证卡号：");
scanf_s("%d", &tab->r[tab->length].cardInfo.cardNum);
printf("请输入持卡人姓名：");
scanf_s("%s", tab->r[tab->length].cardInfo.name,8);
printf("请输入持卡人系别：");
scanf_s("%s", tab->r[tab->length].cardInfo.major,10);
printf("请输入持卡人班号：");
scanf_s("%d", &tab->r[tab->length].cardInfo.classNum);
printf("请问是否继续录入？（Y/N）:");
getchar();
scanf_s("%c", &s);
tab->length++;
}
}
void output(libCardInfo *info){ //输出卡基本信息
printf("\t╔ ╗\n");
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("\t╚ ╝\n");
}
void shellinsertsort(table *tab){ //希尔插入排序并输出
int i, j, d;
d = tab->length / 2;
while (d >= 1){
for (i = d + 1; ilength; i++){ //从第d+1个元素开始，将所有的元素有序的插入相应分组中
tab->r[0] = tab->r[i]; //保存第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]; //插入第i个元素的副本
}
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("%s", major,10);
while (ilength){
if (!strcmp(tab->r[i].cardInfo.major, major)){
output(&(tab->r[i].cardInfo));
j = 0;
}
i++;
}
if (j) printf("\t\t 『没有该系别的记录！』\n");
}
//main.c
int main() {
int x, set = 1;
table tab;
while (set){
printf("\t\t╔═════════════╗\n");
printf("\t\t║ ║\n");
printf("\t\t╠ 欢迎使用借书证管理系统 ╣\n");
printf("\t\t║ ║\n");
printf("\t\t╠═════════════╣\n");
printf("\t\t║ 1.录入借书证基本信息 ║\n");
printf("\t\t║ ║\n");
printf("\t\t║ 2.输出已有借书证信息 ║\n");
printf("\t\t║ ║\n");
printf("\t\t║ 3.系名查找借书证信息 ║\n");
printf("\t\t║ ║\n");
printf("\t\t║ 4.退出借书证管理系统 ║\n");
printf("\t\t╚═════════════╝\n\n");
printf("请按你的需求选择操作：");
scanf_s("%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("没有该选项对应的操作！");
}
system("pause");
system("cls");
}
return 0;
}
```

The issue contains a full C program for a library card management system with sorting and search functions. The problem is not stated; the user likely wants a review, fix, or enhancement. Start by understanding the program's purpose from the code and images. Look for bugs in the shell sort or input handling. Run the program to see its behavior and identify any crashes or logical errors.

索引モデルが issue の本文から書いたものです。