文件名称:contacts1
介绍说明--下载内容来自于网络,使用问题请自行百度
利用线性表实现一个通讯录管理,通信录的数据格式如下:
struct DataType
{
int ID //编号
char name[10] //姓名
char ch //性别
char phone[13] //电话
char addr[31] //地址
}
要求:
? 实现通讯录的建立、增加、删除、修改、查询等功能
? 能够实现简单的菜单交互,即可以根据用户输入的命令,选择不同的操作。
? 能够保存每次更新的数据(选作)
? 能够进行通讯录分类,比如班级类、好友类、黑名单等等(选作)
? 编写测试main()函数测试线性表的正确性
-An address book using the linear table implementation management, and communication of data recorded in the following format: struct DataType {int ID // No char name [10] // name char ch // sex char phone [13] // Phone char addr [31] // address} requirements: ? achieve the establishment of contacts, add, delete, modify, query and other functions to achieve a simple menu ? interaction, which can be based on user input commands, select a different operation. ? be able to save each update of data (selected for) ? contacts can be classified, such as the class category, friends class, black, etc. (selected for) ? writing test main () function to test the accuracy of the linear form
struct DataType
{
int ID //编号
char name[10] //姓名
char ch //性别
char phone[13] //电话
char addr[31] //地址
}
要求:
? 实现通讯录的建立、增加、删除、修改、查询等功能
? 能够实现简单的菜单交互,即可以根据用户输入的命令,选择不同的操作。
? 能够保存每次更新的数据(选作)
? 能够进行通讯录分类,比如班级类、好友类、黑名单等等(选作)
? 编写测试main()函数测试线性表的正确性
-An address book using the linear table implementation management, and communication of data recorded in the following format: struct DataType {int ID // No char name [10] // name char ch // sex char phone [13] // Phone char addr [31] // address} requirements: ? achieve the establishment of contacts, add, delete, modify, query and other functions to achieve a simple menu ? interaction, which can be based on user input commands, select a different operation. ? be able to save each update of data (selected for) ? contacts can be classified, such as the class category, friends class, black, etc. (selected for) ? writing test main () function to test the accuracy of the linear form
(系统自动生成,下载前可以参看下载内容)
下载文件列表
contacts1.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.