当前位置：网站首页>C language to achieve a static version of the address book

C language to achieve a static version of the address book

2022-07-24 17:40:00 【eat_ sleep_ play( )】

This time, the static version is implemented , If the address book is full, you can't add it . Next time, we will implement a dynamic version of the address book , Even if it's full , You can also add capacity . When you exit the program , The previously added information has disappeared , Next time, the address book of file version will be realized , Even exit the program , Information will also be retained .

Catalog

1. Functional analysis

2. Application framework

3. Mind mapping

4. Code module

4.1 main Function code rendering

4.2 Menu functions

4.3 Initialization function

4.4 Add a Contact

4.5 Delete contact information

4.6 Search for contact information

4.7 Find the implementation of the function

4.8 Modify the contact's information

4.9 Print contact information

4.9.1 Sort the contact information

1. Functional analysis

The functions to be realized are ： Add contact information 、 Delete contact information 、 Find contact information 、 Modify contact information 、 Show contact information 、 Sort the contact information .

2. Application framework

The program is divided into test.c、contact.c Two source files and contact.h A header file .
test.c: The main function interface is introduced .
contact.c: The function mainly implements
contact.h: Header file import 、 Function declaration 、 Structure declaration .

3. Mind mapping

4. Code module

4.1 main Function code rendering

int main()
{
	int input = 0;
	contact con;// Mail list 

	// Initialize address book 
	in_it_contact(&con);

	do
	{
		menu();// Print menu functions 
		printf(" Please select ：");
		scanf("%d", &input);
		switch (input)
		{
		case EXIT:
			printf(" Exit address book \n");
			break;
		case ADD:
			add_contact(&con);// Add contact information function 
			break;
		case DEL:
			del_contact(&con);// Delete contact information function 
			break;
		case SERCH:
			search_contact(&con);// Search the specified contact information function 
			break;
		case MODIFY:
			modify_contact(&con);// Modify the specified contact information function 
			break;
		case SHOW:
			show_contact(&con);// Show contact information function 
			break;
		case SORT:
			sort_contact(&con);// Sort contact information function 
			break;
		default:
			printf(" Wrong choice , Please reselect \n");
			break;
		}

	} while (input);
	return 0;
}

analysis ： It mainly introduces the interface of functions , Common do while loop , And will input Variable as while() The conditions in the following brackets , Here is an extremely clever use , When input Variable is 0 When the cycle ends , Termination of procedure , At this time, it is also the same as the previous switch and case One by one .

4.2 Menu functions

void menu()
{
	printf("*********>>>>>>>   Address book selection menu   <<<<<<*********\n");
	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");
}

Use printf To output information that prompts players ,* It can be that the printed content looks simple and beautiful

4.3 Initialization function

void in_it_contact(contact* pc)// initialization 
{
	assert(pc);
	pc->count = 0;// take pc Point to the count
	memset(pc->date, 0, sizeof(pc->date));
}

analysis ： adopt memset() The memory function initializes the information in the address book , At the same time count The variable for recording the number of contacts is set to 0.

4.4 Add a Contact

void add_contact(contact* pc)// add to 
{
	assert(pc);
	if (pc->date == MAX)
	{
		printf(" The address book is full , Unable to add \n");
		return;
	}
	printf(" Please enter a name ：");
	scanf("%s", pc->date[pc->count].name);
	printf(" Please enter age ：");
	scanf("%d", &pc->date[pc->count].age);
	printf(" Please enter gender ：");
	scanf("%s", pc->date[pc->count].sex);
	printf(" Please input the phone number ：");
	scanf("%s", pc->date[pc->count].tele);
	printf(" Please enter the address ：");
	scanf("%s", pc->date[pc->count].addr);

	pc->count++;
	printf(" Add success \n");
}

analysis ： When adding, you should pay attention to the discussion of different situations , First, when the number of contacts is full, you can't continue to add , You can only continue to add when the number of contacts is not full , After adding , The variable to record the number of contacts count add 1.

4.5 Delete contact information

void del_contact(contact* pc)// Delete 
{
	char name[MAX_Name] = { 0 };
	assert(pc);
	if (pc->count == 0)
	{
		printf(" Address book is empty , No information can be deleted \n");
		return;
	}
	printf(" Please enter the name to delete ：");
	scanf("%s", name);
	//1. lookup 
	int ret = find_by_name(pc, name);// Function to find contact name 
	if (-1 == ret)
	{
		printf(" The person to delete does not exist \n");
		return;
	}
	//2. Delete 
	int i = 0;
	for (i = ret; i < pc->count - 1; i++)
	{
		pc->date[i] = pc->date[i + 1];
	}
	pc->count--;

	printf(" Delete successful \n");
}

analysis ： The deletion operation is not complicated , First, check and find the contact we want to delete , Then overwrite the information behind this contact one by one , At the same time, the variable of the number of contacts will be recorded count Minus the value of 1.

4.6 Search for contact information

void search_contact(contact* pc)// Search for 
{
	assert(pc);
	char name[MAX_Name] = { 0 };
	if (pc->count == 0)
	{
		printf(" Address book is empty , There is no information to search \n");
		return;
	}
	printf(" Please enter the name you want to search ：");
	scanf("%s", name);
	//1. lookup 
	int ret = find_by_name(pc, name);
	if (-1 == ret)
	{
		printf(" The person to search does not exist \n");
		return;
	}
	//2. Exhibition 
	printf("%-20s\t%-5s\t%-5s\t%-12s\t%-30s\n", " full name ", " Age ", " Gender ", " Telephone ", " Address ");
	printf("%-20s\t%-5d\t%-5s\t%-12s\t%-30s\n", pc->date[ret].name,
		pc->date[ret].age,
		pc->date[ret].sex,
		pc->date[ret].tele,
		pc->date[ret].addr);
}

analysis ： If found, print out the contact information , If you can't find it, you will be prompted that you can't find it .

4.7 Find the implementation of the function

int find_by_name(contact* pc, char name[])// lookup 
{
	assert(pc);
	int i = 0;
	for (i = 0; i < pc->count; i++)
	{
		if (0 == strcmp(pc->date[i].name, name))
		{
			return i;
		}
	}
	return -1;
}

analysis ： The search function here is implemented by traversing the information in the contact , Stop when the information of the contact we want to find is consistent with that of a contact , If it can be found, return its corresponding subscript , If you can't find it, go back -1.

4.8 Modify the contact's information

void modify_contact(contact* pc)// modify 
{
	assert(pc);
	char name[MAX_Name] = { 0 };
	if (pc->count == 0)
	{
		printf(" Address book is empty , No information can be modified \n");
		return;
	}
	printf(" Please enter the name you want to change ：");
	scanf("%s", name);
	//1. lookup 
	int ret = find_by_name(pc, name);
	if (-1 == ret)
	{
		printf(" The person to modify does not exist \n");
		return;
	}
	//2. modify 
	printf(" The information of the person to be modified has been found , Next, start to modify \n");
	printf(" Please enter the modified name ：");
	scanf("%s", pc->date[ret].name);
	printf(" Please enter the modified age ：");
	scanf("%d", &pc->date[ret].age);
	printf(" Please enter the modified gender ：");
	scanf("%s", pc->date[ret].sex);
	printf(" Please input the modified phone number ：");
	scanf("%s", pc->date[ret].tele);
	printf(" Please enter the modified address ：");
	scanf("%s", pc->date[ret].addr);

	printf(" Modification successful \n");
}

analysis ： First find the person to modify , And then modify ; If can't find , Prompt does not exist . To modify is to re-enter the information