#includestdioh#includestringh#includestdlibh #include malloch#define size 100#define n 20typedef struct node 单链表 链地址法 int number; char addresssize; char namesize; struct node next;newnodeanode;void

The given code is an implementation of a hash table using the chaining method for collision resolution. It allows the user to add records and search for records based on either the name or the phone number.

The code begins by defining the necessary headers and structures. It then initializes the hash table by setting all the linked lists to NULL in the hashlistinit() function.

The hashinputname() function allows the user to input records based on the name as the key. It prompts the user to enter the phone number, address, and name. It then calculates the hash value by converting the first character of the name to an integer and taking the modulo n. It creates a new node, inserts the data, and adds it to the appropriate linked list.

Similarly, the hashshow2name() function allows the user to search for a record based on the name. It prompts the user to enter the name and calculates the hash value. It then iterates through the linked list to find the matching record and displays the details if found.

The hashinput() and hashshow() functions are similar to hashinputname() and hashshow2name(), but they use the phone number as the key instead of the name.

Finally, the scan2() function displays a menu for the user to choose the desired operation. It returns the selected option.

The main function implements a loop that continues until the user chooses to exit the system. It calls the scan2() function to get the user's choice and performs the corresponding operation.

Overall, this code provides a basic implementation of a hash table using the chaining method for collision resolution