实现一个简单的通讯录功能

最近在写一个通讯录，实现的功能有增、删、改、查、排序、显示。这让我想起了大二的实训作业---写一个学生管理系统，俩个的功能差不多。但是本人大二是个铁混子，这次也让我真正的来完成了。

下面看代码

main.c文件

#define _CRT_SECURE_NO_WARNINGS 1
#include"mail_list.h"
void menu()
{
	printf("***1.增加***********2.删除***\n");
	printf("***3.查找***********4.修改***\n");
	printf("***5.显示***********6.排序***\n");
	printf("************0.退出***********\n");

}
int main()
{
	int input = 0;
	//创建通讯录
	struct Contact con;
	//初始化通讯录
	InitContact(&con);

	do
	{
		menu();
		printf("请选择: ");
		scanf("%d", &input);
		switch (input)
		{
		case 1:
			AddContact(&con);
			break;
		case 2:
			DelContact(&con);
			break;
		case 3:
			SezrchContact(&con);
			break;
		case 4:
			ModContact(&con);
			break;
		case 5:
			ShowContact(&con);
			break;
		case 6:
			SortContact(&con);
			break;
		case 0:
			printf("退出通讯录!\n");
			break;
		default:
			printf("选择错误，请重新选择!\n");
			break;

		}
	} while (input);
}

 mail_list.c文件

#define _CRT_SECURE_NO_WARNINGS 1
#include"mail_list.h"

//通讯录初始化函数
void InitContact(struct Contact* ps)
{
	memset(ps->peo, 0, sizeof(ps->peo));
	ps->size = 0;
}

//通讯录添加函数
void AddContact(struct Contact* ps)
{
	if (ps->size == MAX)
	{
		printf("通讯录已满!\n");
	}
	else
	{
		printf("请输入名字: ");
		scanf("%s", ps->peo[ps->size].name);
		printf("请输入电话: ");
		scanf("%s", ps->peo[ps->size].phone);
		printf("请输入地址: ");
		scanf("%s", ps->peo[ps->size].address);
		printf("请输入性别: ");
		scanf("%s", ps->peo[ps->size].sex);
		printf("请输入年龄: ");
		scanf("%d", &ps->peo[ps->size].age);
		ps->size++;
		printf("添加成功!\n");
	}

}


//通讯录显示函数
void ShowContact(const struct Contact* ps)
{
	if (ps->size == 0)
	{
		printf("通讯录无人，请添加！\n");
	}
	else
	{
		printf("%-20s\t%-4s\t%-5s\t%-12s\t%-20s\t\n", "名字", "年龄", "性别", "电话", "地址");
		int i = 0;
		for (i = 0; i < ps->size; i++)
		{
			printf("%-20s\t%-4d\t%-5s\t%-12s\t%-20s\t\n",
				ps->peo[i].name,
				ps->peo[i].age,
				ps->peo[i].sex,
				ps->peo[i].phone,
				ps->peo[i].address);
		}
	}
}

//删除联系人
void DelContact(struct Contact* ps)
{
	char name[MAX_NAME];
	printf("请输入要删除的人!\n");
	scanf("%s", name);

	//1.查找要删除的人的位置
	int i = 0;
	for (i = 0; i < ps->size; i++)
	{
		if (0 == strcmp(ps->peo[i].name, name))
		{
			break;
		}
	}
	//2.删除
	if (i == ps->size)
	{
		printf("此人不在！\n");
	}
	else
	{
		int j = 0;
		for (j = i; j < ps->size - 1; j++)
		{
			ps->peo[j] = ps->peo[j + 1];
		}
		ps->size--;
		printf("删除成功！\n");
	}

}

//通讯录查找
void SezrchContact(const struct Contact* ps)
{
	char name[MAX_NAME];
	printf("请输入要查找的人!\n");
	scanf("%s", name);
	int i = 0;
	for (i = 0; i < ps->size; i++)
	{
		if (0 == strcmp(ps->peo[i].name, name))
		{
			break;
		}
	}
	if (i == ps->size)
	{
		printf("此人不在！\n");
	}
	else
	{
		printf("找到了!\n");
		printf("%-20s\t%-4s\t%-5s\t%-12s\t%-20s\t\n", "名字", "年龄", "性别", "电话", "地址");
		printf("%-20s\t%-4d\t%-5s\t%-12s\t%-20s\t\n",
			ps->peo[i].name,
			ps->peo[i].age,
			ps->peo[i].sex,
			ps->peo[i].phone,
			ps->peo[i].address);
	}
}

//修改通讯录
void ModContact(struct Contact* ps)
{
	char name[MAX_NAME];
	printf("请输入要修改的人!\n");
	scanf("%s", name);
	int i = 0;
	for (i = 0; i < ps->size; i++)
	{
		if (0 == strcmp(ps->peo[i].name, name))
		{
			break;
		}
	}
	if (i == ps->size)
	{
		printf("此人不在！\n");
	}
	else
	{
		printf("请输入名字: ");
		scanf("%s", ps->peo[i].name);
		printf("请输入电话: ");
		scanf("%s", ps->peo[i].phone);
		printf("请输入地址: ");
		scanf("%s", ps->peo[i].address);
		printf("请输入性别: ");
		scanf("%s", ps->peo[i].sex);
		printf("请输入年龄: ");
		scanf("%d", &ps->peo[i].age);
		printf("修改成功!\n");
	}
}

//通讯录排序
void SortContact(struct Contact* ps)
{

	int i = 0;
	//此处按照年龄大小排序
	int ret = ps->peo[0].age;
	//定义一个信息结构体作为中间变量
	struct People c = { 0 };
	for (i = 1; i < ps->size; i++)
	{

		if (ret > ps->peo[i].age)
		{
			c = ps->peo[i - 1];
			ps->peo[i - 1] = ps->peo[i];
			ps->peo[i] = c;
		}
	}
	printf("排序成功!\n");
}

mail_list.h文件

#include<stdio.h>
#include<string.h>
#define MAX 1000

#define MAX_NAME 20
#define MAX_PHONE 20
#define MAX_ADDRESS 20
#define MAX_SEX 5
struct People
{
	char name[MAX_NAME];
	char phone[MAX_PHONE];
	char address[MAX_ADDRESS];
	char sex[MAX_SEX];
	int age;

};
//创建一个通讯录类型
struct Contact
{
	struct People peo[MAX];
	int size;  //记录当前通讯录中元素个数
};

//声明函数
void InitContact(struct Contact* ps);
void AddContact(struct Contact* ps); 
void ShowContact(const struct Contact* ps);
void DelContact( struct Contact* ps);
void SezrchContact(const struct Contact* ps);
void ModContact(struct Contact* ps);
void SortContact(struct Contact* ps);

 最后由于本人学艺不精，排序方面用的是最简单的按年龄排序。原本想按照名字查找，奈何使用memcmp（）比较时总出错。