用C语言超市信息管理系统 功能要求: 1.每一条记录包括一个商品的编号,名称,价格,条形码,进货日期。库存,销售数量。 2.输入功能:可以一次完成若干条记录的输入。 3.显示功能:完成全部记录的显示。 4.查找功能:用折半查找完成按商品编号查找记录并显示。 5.排序功能:用希尔排序按销售数量从高到低或者按照商品编号进行排序。 6. 插入功能:按编号插入一条记录。 7.将记录保存在文件中。 8. 应提供一个菜单来调用各个功能,调用菜单的界面应尽可能清晰美观。 9.删除功能 10.修改功能 11.代码要有亮点,并且将代码展示出来

时间: 2024-01-21 08:16:45 浏览: 17
以下是一个基于C语言的超市信息管理系统的实现,具有上述功能要求: ```c #include <stdio.h> #include <stdlib.h> #include <string.h> struct product { int id; char name[50]; float price; char barcode[20]; char purchase_date[20]; int stock; int sold_count; }; // Function prototypes void display_menu(); void add_product(struct product *products, int *count); void display_products(struct product *products, int count); void search_product(struct product *products, int count); void sort_products_by_sold_count(struct product *products, int count); void sort_products_by_id(struct product *products, int count); void insert_product(struct product *products, int *count); void delete_product(struct product *products, int *count); void modify_product(struct product *products, int count); void save_to_file(struct product *products, int count); void load_from_file(struct product *products, int *count); int main() { struct product products[100]; int count = 0; int choice; load_from_file(products, &count); do { display_menu(); printf("Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: add_product(products, &count); break; case 2: display_products(products, count); break; case 3: search_product(products, count); break; case 4: sort_products_by_sold_count(products, count); break; case 5: sort_products_by_id(products, count); break; case 6: insert_product(products, &count); break; case 7: delete_product(products, &count); break; case 8: modify_product(products, count); break; case 9: save_to_file(products, count); printf("Products saved to file!\n"); break; case 10: load_from_file(products, &count); printf("Products loaded from file!\n"); break; case 11: printf("Exiting program...\n"); break; default: printf("Invalid choice. Please try again.\n"); } } while (choice != 11); return 0; } void display_menu() { printf("\n-- Supermarket Information Management System --\n"); printf("1. Add product\n"); printf("2. Display all products\n"); printf("3. Search product by ID\n"); printf("4. Sort products by sold count\n"); printf("5. Sort products by ID\n"); printf("6. Insert product\n"); printf("7. Delete product\n"); printf("8. Modify product\n"); printf("9. Save products to file\n"); printf("10. Load products from file\n"); printf("11. Exit\n"); } void add_product(struct product *products, int *count) { printf("\nEnter product details:\n"); printf("ID: "); scanf("%d", &products[*count].id); printf("Name: "); scanf("%s", products[*count].name); printf("Price: "); scanf("%f", &products[*count].price); printf("Barcode: "); scanf("%s", products[*count].barcode); printf("Purchase date: "); scanf("%s", products[*count].purchase_date); printf("Stock: "); scanf("%d", &products[*count].stock); printf("Sold count: "); scanf("%d", &products[*count].sold_count); (*count)++; } void display_products(struct product *products, int count) { if (count == 0) { printf("\nNo products found.\n"); return; } printf("\n%-5s %-20s %-10s %-20s %-20s %-8s %-10s\n", "ID", "Name", "Price", "Barcode", "Purchase date", "Stock", "Sold"); for (int i = 0; i < count; i++) { printf("%-5d %-20s %-10.2f %-20s %-20s %-8d %-10d\n", products[i].id, products[i].name, products[i].price, products[i].barcode, products[i].purchase_date, products[i].stock, products[i].sold_count); } } void search_product(struct product *products, int count) { if (count == 0) { printf("\nNo products found.\n"); return; } int id; printf("\nEnter product ID to search for: "); scanf("%d", &id); int left = 0; int right = count - 1; int found = 0; while (left <= right) { int mid = (left + right) / 2; if (products[mid].id == id) { printf("\n%-5s %-20s %-10s %-20s %-20s %-8s %-10s\n", "ID", "Name", "Price", "Barcode", "Purchase date", "Stock", "Sold"); printf("%-5d %-20s %-10.2f %-20s %-20s %-8d %-10d\n", products[mid].id, products[mid].name, products[mid].price, products[mid].barcode, products[mid].purchase_date, products[mid].stock, products[mid].sold_count); found = 1; break; } else if (products[mid].id < id) { left = mid + 1; } else { right = mid - 1; } } if (!found) { printf("\nProduct not found.\n"); } } void sort_products_by_sold_count(struct product *products, int count) { for (int gap = count / 2; gap > 0; gap /= 2) { for (int i = gap; i < count; i++) { struct product temp = products[i]; int j; for (j = i; j >= gap && products[j - gap].sold_count < temp.sold_count; j -= gap) { products[j] = products[j - gap]; } products[j] = temp; } } printf("\nProducts sorted by sold count (descending order):\n"); display_products(products, count); } void sort_products_by_id(struct product *products, int count) { for (int gap = count / 2; gap > 0; gap /= 2) { for (int i = gap; i < count; i++) { struct product temp = products[i]; int j; for (j = i; j >= gap && products[j - gap].id > temp.id; j -= gap) { products[j] = products[j - gap]; } products[j] = temp; } } printf("\nProducts sorted by ID:\n"); display_products(products, count); } void insert_product(struct product *products, int *count) { int id; printf("\nEnter product ID to insert: "); scanf("%d", &id); // Shift elements to make room for insertion int i; for (i = *count - 1; i >= 0 && products[i].id > id; i--) { products[i + 1] = products[i]; } // Insert new element printf("Enter product details:\n"); printf("Name: "); scanf("%s", products[i + 1].name); printf("Price: "); scanf("%f", &products[i + 1].price); printf("Barcode: "); scanf("%s", products[i + 1].barcode); printf("Purchase date: "); scanf("%s", products[i + 1].purchase_date); printf("Stock: "); scanf("%d", &products[i + 1].stock); printf("Sold count: "); scanf("%d", &products[i + 1].sold_count); products[i + 1].id = id; (*count)++; } void delete_product(struct product *products, int *count) { if (*count == 0) { printf("\nNo products found.\n"); return; } int id; printf("\nEnter product ID to delete: "); scanf("%d", &id); int i; for (i = 0; i < *count; i++) { if (products[i].id == id) { // Shift elements after deletion point for (int j = i; j < *count - 1; j++) { products[j] = products[j + 1]; } (*count)--; printf("\nProduct with ID %d deleted.\n", id); return; } } printf("\nProduct not found.\n"); } void modify_product(struct product *products, int count) { if (count == 0) { printf("\nNo products found.\n"); return; } int id; printf("\nEnter product ID to modify: "); scanf("%d", &id); for (int i = 0; i < count; i++) { if (products[i].id == id) { printf("\nEnter new product details:\n"); printf("Name: "); scanf("%s", products[i].name); printf("Price: "); scanf("%f", &products[i].price); printf("Barcode: "); scanf("%s", products[i].barcode); printf("Purchase date: "); scanf("%s", products[i].purchase_date); printf("Stock: "); scanf("%d", &products[i].stock); printf("Sold count: "); scanf("%d", &products[i].sold_count); printf("\nProduct with ID %d modified.\n", id); return; } } printf("\nProduct not found.\n"); } void save_to_file(struct product *products, int count) { FILE *fp = fopen("products.dat", "wb"); fwrite(&count, sizeof(int), 1, fp); fwrite(products, sizeof(struct product), count, fp); fclose(fp); } void load_from_file(struct product *products, int *count) { FILE *fp = fopen("products.dat", "rb"); if (fp == NULL) { printf("\nNo file found.\n"); return; } fread(count, sizeof(int), 1, fp); fread(products, sizeof(struct product), *count, fp); fclose(fp); } ``` 该程序使用了结构体来存储商品信息,并提供了各种功能来添加、显示、查找、排序、插入、删除和修改商品信息,以及将商品信息保存到文件中或从文件中加载商品信息。该程序还提供了一个清晰美观的菜单界面,让用户可以方便地使用各种功能。

相关推荐

最新推荐

recommend-type

大一C语言课程设计图书信息管理系统.doc

大一C语言课程设计图书信息管理系统.doc
recommend-type

C语言实现车辆出租管理系统

主要为大家详细介绍了C语言实现车辆出租管理系统,具有一定的参考价值,感兴趣的小伙伴们可以参考一下
recommend-type

C语言数组实现学生信息管理系统设计

主要为大家详细介绍了C语言数组实现学生信息管理系统设计,具有一定的参考价值,感兴趣的小伙伴们可以参考一下
recommend-type

C语言实现简单航班管理系统

主要为大家详细介绍了C语言实现简单航班管理系统,文中示例代码介绍的非常详细,具有一定的参考价值,感兴趣的小伙伴们可以参考一下
recommend-type

C语言实现餐饮结账管理系统

主要为大家详细介绍了C语言实现餐饮结账管理系统,文中示例代码介绍的非常详细,具有一定的参考价值,感兴趣的小伙伴们可以参考一下
recommend-type

zigbee-cluster-library-specification

最新的zigbee-cluster-library-specification说明文档。
recommend-type

管理建模和仿真的文件

管理Boualem Benatallah引用此版本:布阿利姆·贝纳塔拉。管理建模和仿真。约瑟夫-傅立叶大学-格勒诺布尔第一大学,1996年。法语。NNT:电话:00345357HAL ID:电话:00345357https://theses.hal.science/tel-003453572008年12月9日提交HAL是一个多学科的开放存取档案馆,用于存放和传播科学研究论文,无论它们是否被公开。论文可以来自法国或国外的教学和研究机构,也可以来自公共或私人研究中心。L’archive ouverte pluridisciplinaire
recommend-type

MATLAB柱状图在信号处理中的应用:可视化信号特征和频谱分析

![matlab画柱状图](https://img-blog.csdnimg.cn/3f32348f1c9c4481a6f5931993732f97.png) # 1. MATLAB柱状图概述** MATLAB柱状图是一种图形化工具,用于可视化数据中不同类别或组的分布情况。它通过绘制垂直条形来表示每个类别或组中的数据值。柱状图在信号处理中广泛用于可视化信号特征和进行频谱分析。 柱状图的优点在于其简单易懂,能够直观地展示数据分布。在信号处理中,柱状图可以帮助工程师识别信号中的模式、趋势和异常情况,从而为信号分析和处理提供有价值的见解。 # 2. 柱状图在信号处理中的应用 柱状图在信号处理
recommend-type

用Spring boot和vue写一个登录注册界面

好的,这是一个比较常见的技术问题,我可以为您提供一些参考资料和思路。首先,您可以使用Spring Boot作为后端框架来处理用户认证和注册的逻辑,比如使用Spring Security实现用户登录认证。同时,您还需要设计相应的数据模型和数据库表结构来存储用户信息。在前端方面,您可以使用Vue.js作为框架来构建登录注册页面,使用Axios来发起API请求并和后端进行交互。当然,在实现过程中,还需要考虑一些具体细节,比如数据校验、安全性和用户体验等方面。希望这些信息能够帮助到您。
recommend-type

JSBSim Reference Manual

JSBSim参考手册,其中包含JSBSim简介,JSBSim配置文件xml的编写语法,编程手册以及一些应用实例等。其中有部分内容还没有写完,估计有生之年很难看到完整版了,但是内容还是很有参考价值的。