排序和查找系统（快排，二叉搜索）

include

define maxn 30

struct Node
{
int ximing;
long library_card;
char name[maxn];
char student_id[maxn];
};
Node a[maxn];
void quicksort(Node a[], int left, int right)
{
int i, j;
if (left >= right)
return;
i = left, j = right;
a[0] = a[i];
while (i != j)
{
while (a[j].ximing > a[0].ximing && i < j)
–j;
if (i < j)
{
a[i] = a[j];
i++;
}
while (a[i].ximing < a[0].ximing && i < j)
++i;
if (i < j)
{
a[j] = a[i];
j–;
}
}
a[i] = a[0];
quicksort(a, left, i - 1);
quicksort(a, i + 1, right);
}
void bin_search(Node a[], int n, int x)
{
int left = 1, right = n;
int ans = 0;
while (left <= right)
{
int mid = (left + right) / 2;
if (a[mid].ximing == x)
{
ans = mid;
break;
}
else if (a[mid].ximing < x)
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
if (ans == 0)
{
printf(“没找到\n”);
}
else
{
int start = ans, ends = ans;
while (a[start].ximing == x)
start–;
while (a[ends].ximing == x)
ends++;
printf(“%d系的信息为：\n”, x);
for (int i = start + 1; i < ends; i++)
{
printf(“%d %d %s %s\n”, a[i].ximing, a[i].library_card, a[i].name, a[i].student_id);
}
}
}

int main()
{
int n;
int i;
FILE *fpRead;
errno_t err;
err = fopen_s(&fpRead, “data.txt”, “r”);
if (fpRead == NULL)
{
return 0;
}
fscanf_s(fpRead, “%d”, &n, 4);
for (i = 1; i<=n; i++)
{
fscanf_s(fpRead, “%d”, &a[i].ximing,20);
fscanf_s(fpRead, “%d”, &a[i].library_card,20);
fscanf_s(fpRead, “%s”, a[i].name, 20);
fscanf_s(fpRead, “%s”, a[i].student_id, 20);
printf(“test 3\n”);
}
fclose(fpRead);
printf(” 系别 借书证号 姓名 学号\n”);
for (i = 1; i <=n; i++)
{
printf(“%10d,%10d,%10s,%10s\n”, a[i].ximing, a[i].library_card, a[i].name, a[i].student_id);
}
quicksort(a, 1, n);
printf(“输出的是按系名排序后的信息是：\n”);
for (int i = 1; i <= n; i++)
{
printf(“%d %d %s %s\n”, a[i].ximing, a[i].library_card, a[i].name, a[i].student_id);
}
int x;
printf(“输入要输出的系名的信息:\n”);
scanf_s(“%d”, &x);
bin_search(a, n, x);
}

/*data.txt
3
10 16070000 chenzj10 1607094110
8 16070008 chenzj8 1607094108
9 16070009 chenzj9 1607094109
*/