利用结构体实现一个简单的通讯录

test.c

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include"tongxunlu.h"
void menu()
{
	printf("********************************\n");
	printf("**** 1.add      2.del    *******\n");
	printf("**** 3.search   4.modify *******\n");
	printf("**** 5.show     6.sort   *******\n");
	printf("********    0.exit  ************\n");
	printf("********************************\n");
}
int main()
{
	int input;
	//创建通讯录
	struct contact con;//con就是通讯录，里面包含：1000的元素的数和size
	//初始化通讯录
	inittxl(&con);
	do
	{
		menu();
		printf("请选择");
		scanf("%d", &input);
		switch (input)
		{
		case 0:
			printf("退出通讯录");
			break;
		case 1:
			addtxl(&con);
			break;
		case 2:
			deltxl(&con);
			break;
		case 3:
			searchtxl(&con);
			break;
		case 4:
			modifytxl(&con);
			break;
		case 5:
			showtxl(&con);
			break;
		case 6:
			sorttxl(&con);
			break;
		default:
			printf("选择错误\n");
			break;
		}
	} while (input);
	return 0;
}

tongxunlu.c

#define _CRT_SECURE_NO_WARNINGS 1
#include"tongxunlu.h"
void inittxl(struct contact* ps)
{
	memset(ps->date,0, sizeof(ps->date));
	ps->size = 0;
}

int findname(const struct contact* ps,char name[maxname])
{
	int i = 0;
	for (i = 0; i < ps->size; i++)
	{
		//if (name == ps->date[i].name)//字符串不能这样比较；
		if (strcmp(name, ps->date[i].name) == 0)
		{
			return i;
		}
	}
	return -1;
}

void addtxl(struct contact* ps)
{
	if (ps->size == max)
	{
		printf("通讯录已满");
	}
	else
	{
		printf("请输入名字");
		scanf("%s", ps->date[ps->size].name);
		printf("请输入年龄");
		scanf("%d", &(ps->date[ps->size].age));
		printf("请输入性别");
		scanf("%s", ps->date[ps->size].sex);
		printf("请输入电话");
		scanf("%s", ps->date[ps->size].tele);
		printf("请输入住址");
		scanf("%s", ps->date[ps->size].addr);
		ps->size++;
		printf("添加成功\n");
	}
}

void showtxl(const struct contact* ps)
{
	if (ps->size == 0)
	{
		printf("通讯录为空\n");
	}
	else
	{
		int i = 0;
		printf("%-20s\t%-4s\t%-5s\t%-12s\t%-20s\n", "名字", "年龄", "性别", "电话", "地址");
		for (i = 0; i < ps->size; i++)
		{
			printf("%-20s\t%-4d\t%-5s\t%-12s\t%-20s\n", 
				ps->date[i].name,
				ps->date[i].age,
				ps->date[i].sex,
				ps->date[i].tele,
				ps->date[i].addr);
		}
	}
}

void deltxl(struct contact* ps)
{
	char name[maxname];
	printf("请输入要删除的人的名字\n");
	scanf("%s", &name);
	int i = findname(ps,name);
	if (i == -1)
	{
		printf("该用户不存在\n");
	}
	else
	{
		int j = 0;
		for (j = i; j < ps->size - 1; j++)
		{
			ps->date[j] = ps->date[j + 1];
		}
		ps->size--;
		printf("删除成功\n");
	}
}

void searchtxl(const struct contact* ps)
{
	char name[maxname];
	printf("请输入要查找的人的名字\n");
	scanf("%s", &name);
	int i = findname(ps, name);
	if (i == -1)
	{
		printf("该用户不存在");
	}
	else
	{
		printf("%-20s\t%-4s\t%-5s\t%-12s\t%-20s\n", "名字", "年龄", "性别", "电话", "地址");  
		printf("%-20s\t%-4d\t%-5s\t%-12s\t%-20s\n",
			ps->date[i].name,
			ps->date[i].age,
			ps->date[i].sex,
			ps->date[i].tele,
			ps->date[i].addr);
	}
}

void modifytxl(struct contact* ps)
{
	char name[maxname];
	printf("请输入要修改的人的名字\n");
	scanf("%s", &name);
	int i = findname(ps, name);
	if (i == -1)
	{
		printf("该用户不存在");
	}
	else
	{
		printf("请输入名字");
		scanf("%s", ps->date[i].name);
		printf("请输入年龄");
		scanf("%d", &(ps->date[i].age));
		printf("请输入性别");
		scanf("%s", ps->date[i].sex);
		printf("请输入电话");
		scanf("%s", ps->date[i].tele);
		printf("请输入住址");
		scanf("%s", ps->date[i].addr);
		printf("修改完成\n");
	}
}

int cmpage(const void* e1, const void* e2)
{
	return ((struct contact*)e1)->date->age - ((struct contact*)e2)->date->age;
}
void sorttxl(struct contact* ps)
{
	qsort(ps->date, ps->size, sizeof(ps->date[0]), cmpage);
	printf("按年龄排序成功\n");
}

tongxunlu.h

#define _CRT_SECURE_NO_WARNINGS 1
#include<memory.h>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define max 1000
#define maxname 20
#define maxsex 5
#define maxtele 12
#define maxaddr 30

struct peoinfo
{
	char name[maxname];
	int age;
	char sex[maxsex];
	char tele[maxtele];
	char addr[maxaddr];
};

struct contact
{
	struct peoinfo date[max];//存放一个信息；
	int size;//记录当前已经有的元素个数；
};

//声明函数；
void inittxl(struct contact* ps);
void addtxl(struct contact* ps);
void showtxl(const struct contact* ps);
void deltxl(struct contact* ps);
void searchtxl(const struct contact* ps);
void modifytxl(struct contact* ps);
void sorttxl(struct contact* ps);