实验9-8 通讯录排序

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct node
{
    char name[11];
    char birthday[9];
    char phone[18];
    struct node *next;
} NODE, *LINK;
void AddNewNode(LINK head, int n);
void PrintList(LINK head);
void cleanList(LINK head);
int main(void)
{
    int n;
    LINK head;

    head = (LINK)malloc(sizeof(NODE));
    head->next = NULL;

    scanf("%d", &n);
    AddNewNode(head, n);
    PrintList(head);
    cleanList(head);

    return 0;
}
void AddNewNode(LINK head, int n)
{
    LINK tail = head;
    LINK p, q, newNode;

    for (int i = 0; i < n; i++)
    {
        newNode = (LINK)malloc(sizeof(NODE));
        scanf("%s %s %s", newNode->name, newNode->birthday, newNode->phone);
        newNode->next = NULL;
        if (i == 0)
        {
            tail->next = newNode;
            tail = newNode;
        }
        else
        {
            q = head;
            p = head->next;
            while (p != NULL)
            {
                if (strcmp(newNode->birthday, p->birthday) < 0)
                {
                    q->next = newNode;
                    newNode->next = p;
                    break;
                }
                else
                {
                    q = p;
                    p = p->next;
                }
            }
            if (p == NULL)
            {
                q->next = newNode;
            }
        }
    }
}
void PrintList(LINK head)
{
    LINK p = head->next;

    while (p != NULL)
    {
        printf("%s %s %s\n", p->name, p->birthday, p->phone);
        p = p->next；
    }
}
void cleanList(LINK head)
{
    LINK p;

    while (head != NULL)
    {
        p = head->next;
        free(head);
        head = p;
    }
}