1.基于顺序存储结构的图书信息表的创建和输出 2..基于顺序存储结构的图书信息表的排序 3.基于顺序存储结构的图书信息表的修改

#include <stdio.h> #include <stdlib.h> #include <string.h> #define OK 1 #define ERROR 0 #define OVERFLOW -2 #define MAXSIZE 1000 typedef struct { char no[20]; char name[60]; float price; } Book; typedef struct { Book *elem; int length; } SqList; int BubbleSort_Sq(SqList L) { for (int i = 0; i < L.length - 1; i++) { for (int j = 0; j < L.length - i - 1; j++) { if (L.elem[j].price < L.elem[j + 1].price) { Book book = L.elem[j]; L.elem[j] = L.elem[j + 1]; L.elem[j + 1] = book; } } } return OK; } int main() { SqList bookList; int i = 0; int maxBooks = MAXSIZE; // Define a maximum number of books to avoid overflows bookList.elem = (Book *)malloc(maxBooks * sizeof(Book)); bookList.length = 0; // Initialize the length to 0 char input[20]; // Buffer to store input while (1) { if (i >= maxBooks) { printf("已达到书的最大数量，无法继续添加。\n"); break; } // Read input without prompts scanf("%s", input); // Check if input is '0 0 0' if (strcmp(input, "0") == 0) { break; // Input is '0', so stop } // Store input in bookList strcpy(bookList.elem[i].no, input); scanf("%s%f", bookList.elem[i].name, &bookList.elem[i].price); i++; } bookList.length = i; // Update the actual number of books entered // Sort the bookList BubbleSort_Sq(bookList); // Save the sorted list to out.txt FILE *file = fopen("out.txt", "w"); if (file == NULL) { printf("打开文件时出错！"); return ERROR; } for (i = 0; i < bookList.length; i++) { fprintf(file, "ISBN: %s, 书名: %s, 价格: %.2f\n", bookList.elem[i].no, bookList.elem[i].name, bookList.elem[i].price); } fclose(file); // Display the sorted list in the console printf("\n书籍的排序列表:\n"); for (i = 0; i < bookList.length; i++) { printf("ISBN: %s, 书名: %s, 价格: %.2f\n", bookList.elem[i].no, bookList.elem[i].name, bookList.elem[i].price); } free(bookList.elem); return 0; }