通过结构体嵌套实现一个容纳100个人信息的通讯录,并实现增、删、改、查、打印、排序功能
头文件部分:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#define SYS system("pause")
#define R0 return 0
#include <assert.h>
#define MAX_NAME 30
#define MAX_SEX 5
#define MAX_TEL 11
#define MAX_ADDRESS 50
#define MAX_PELIST 100
struct contacts
{
char name[MAX_NAME];
char sex[MAX_SEX];
int age;
char tel[MAX_TEL];
char address[MAX_ADDRESS];
};
struct con
{
struct contacts pelist[MAX_PELIST];
int count;
};
void add(struct con* conlist);
void init(struct con*conlist);
void modify(struct con*conlist);
void print(struct con*conlist);
void search(struct con*conlist);
void del(struct con*conlist);
void sort(struct con*conlist);
主体文件部分:
void menu()
{
printf("----------------------\n");
printf("--------通 讯 录------\n");
printf("--------1、新增-------\n");
printf("--------2、修改-------\n");
printf("--------3、删除-------\n");
printf("--------4、查找-------\n");
printf("--------5、打印-------\n");
printf("--------6、排序-------\n");
printf("--------0、退出-------\n");
printf("----------------------\n");
}
int main()
{
struct con conlist;
void(*fun[7])(struct con *conlist) = { 0, add, modify, del, search, print, sort };
int input=1;
//初始化函数
init(&conlist);
//创建函数数组
menu();
while (input)
{
printf("enter options->");
scanf("%d", &input);
if (input == 0)
{
printf("exit contacts\n");
break;
}
else if (input > 0 && input <= 6)
{
fun[input](&conlist);
}
else
{
printf("input error ");
printf("please re-enter.\n");
}
}
SYS;
R0;
}
实现函数部分 :
#include"contacts.h"
//struct contacts
//{
// char name[MAX_NAME];
// char sex[MAX_SEX];
// int age;
// char tel[MAX_TEL];
// char address[MAX_ADDRESS];
//};
//搜索排序名字
static int cmp_name(const void*e1, const void *e2)
{
return strcmp(((struct contacts *)e1)->name, ((struct contacts *)e2)->name);
}
//搜索年龄排序
static int cmp_age(const void*e1, const void *e2)
{
return ((struct contacts *)e1)->age - ((struct contacts *)e2)->age;
}
//搜索函数
static int findname(struct con*conlist, char *name)
{
int i = 0;
while (i < (conlist->count))
{
if (strcmp(name, conlist->pelist[i].name) == 0)
{
return i;
}
i++;
}
return -1;
}
//初始化通讯录
void init(struct con*conlist)
{
assert(conlist);
conlist->count = 0;
memset(conlist->pelist, 0, sizeof(conlist->pelist));
}
//新增通讯录内容
void add(struct con* conlist)
{
assert(conlist);
if (conlist->count == 100)
{
printf("the contacts is full\n");
return;
}
printf("please input name->:");
scanf("%s", (conlist->pelist + conlist->count)->name);
printf("please input sex->:");
scanf("%s", (conlist->pelist + conlist->count)->sex);
printf("please input age->:");
scanf("%d", &((conlist->pelist + conlist->count)->age));
printf("please input tel->:");
scanf("%s", (conlist->pelist + conlist->count)->tel);
printf("please input address->:");
scanf("%s", (conlist->pelist + conlist->count)->address);
conlist->count++;
}
//修改通讯录
void modify(struct con*conlist)
{
assert(conlist);
char name[MAX_NAME];
if (conlist->count == 0)
{
printf("通讯录没有内容\n");
return;
}
printf("search name\n");
scanf("%s", name);
int ret =findname(conlist, name);
if (ret != -1)
{
printf("please input name->:");
scanf("%s", (conlist->pelist + conlist->count)->name);
printf("please input sex->:");
scanf("%s", (conlist->pelist + conlist->count)->sex);
printf("please input age->:");
scanf("%d", &((conlist->pelist + conlist->count)->age));
printf("please input tel->:");
scanf("%s", (conlist->pelist + conlist->count)->tel);
printf("please input address->:");
scanf("%s", (conlist->pelist + conlist->count)->address);
}
return;
}
//打印
void print(struct con*conlist)
{
int i = 0;
printf("%30s%5s%5s%11s%50s\n","name","sex","age","tel","address" );
while (i < conlist->count)
{
printf("%30s%5s%5d%11s%50s\n", conlist->pelist[i].name, conlist->pelist[i].sex, conlist->pelist[i].age, conlist->pelist[i].tel, conlist->pelist[i].address);
i++;
}
}
//查找通讯录
void search(struct con*conlist)
{
assert(conlist);
char name[30];
printf("enter name\n");
scanf("%s", name);
int ret = findname(conlist,name);
if (ret != -1)
{
printf("%30s%5s%5s%11s%50s\n", "name", "sex", "age", "tel", "address");
printf("%30s%5s%5d%11s%50s\n", conlist->pelist[ret].name, conlist->pelist[ret].sex, conlist->pelist[ret].age, conlist->pelist[ret].tel, conlist->pelist[ret].address);
}
else
{
printf("no info to return\n");
}
}
//删除通讯录
void del(struct con*conlist)
{
assert(conlist);
char name[30];
printf("enter name\n");
scanf("%s", name);
int ret = findname(conlist, name);
if (ret != -1)
{
while (ret < conlist->count)
{
conlist->pelist[ret] = conlist->pelist[ret + 1];
ret++;
}
printf("erasing end\n");
conlist->count--;
}
else
{
printf("del error\n");
}
}
void sort(struct con*conlist)
{
int i = 0;
while (i < conlist->count)
{
qsort(conlist->pelist, conlist->count, sizeof(struct contacts), cmp_name);
i++;
}
}