C语言实现强大图书信息管理系统：增删改查排序功能全搞定

```c #include <stdio.h> #include <stdlib.h> // 定义图书结构体 typedef struct { char title[50]; char author[50]; float price; } Book; // 定义图书表 Book bookTable[100]; int bookCount = 0; // 根据指定图书个数，逐个输入图书信息 void inputBookInfo(int count) { for (int i = 0; i < count; i++) { printf("请输入第%d本图书的", i+1); scanf(" %[^\n]", bookTable[bookCount].title); printf("请输入第%d本图书的作者：", i+1); scanf(" %[^\n]", bookTable[bookCount].author); printf("请输入第%d本图书的价格：", i+1); scanf("%f", &bookTable[bookCount].price); bookCount++; } } // 逐个显示图书表中所有图书的相关信息 void displayBookInfo() { printf("图书信息：\n"); for (int i = 0; i < bookCount; i++) { printf("%d. %s 作者：%s 价格：%.2f\n", i+1, bookTable[i].title, bookTable[i].author, bookTable[i].price); } } // 将新图书插入到图书表中指定的位置 void insertBook(int position, Book newBook) { for (int i = bookCount; i > position; i--) { bookTable[i] = bookTable[i-1]; } bookTable[position] = newBook; bookCount++; } // 将该图书从图书表中删除 void deleteBook(int position) { for (int i = position; i < bookCount-1; i++) { bookTable[i] = bookTable[i+1]; } bookCount--; } // 统计表中图书总数 void countBooks() { printf("图书总数：%d\n", bookCount); } // 使用冒泡排序算法按照图书价格降序排序 void sortBooks() { for (int i = 0; i < bookCount-1; i++) { for (int j = 0; j < bookCount-i-1; j++) { if (bookTable[j].price < bookTable[j+1].price) { Book temp = bookTable[j]; bookTable[j] = bookTable[j+1]; bookTable[j+1] = temp; } } } } int main() { int choice; do { printf("\n图书信息管理系统菜单：\n"); printf("1. 输入图书信息\n"); printf("2. 显示图书信息\n"); printf("3. 插入图书\n"); printf("4. 删除图书\n"); printf("5. 统计图书总数\n"); printf("6. 按价格排序\n"); printf("7. 退出\n"); printf("请选择操作："); scanf("%d", &choice); switch(choice) { case 1: { int count; printf("请输入图书个数："); scanf("%d", &count); inputBookInfo(count); break; } case 2: displayBookInfo(); break; case 3: { Book newBook; int position; printf("请输入要插入的位置："); scanf("%d", &position); printf("请输入要插入的图书的"); scanf(" %[^\n]", newBook.title); printf("请输入要插入的图书的作者："); scanf(" %[^\n]", newBook.author); printf("请输入要插入的图书的价格："); scanf("%f", &newBook.price); insertBook(position-1, newBook); break; } case 4: { int position; printf("请输入要删除的位置："); scanf("%d", &position); deleteBook(position-1); break; } case 5: countBooks(); break; case 6: sortBooks(); break; case 7: exit(0); break; default: printf("无效选择！\n"); } } while (1); return 0; } ``` ######[AI写代码神器 | 2512点数解答 | 2024-06-30 22:44:24]