数据结构实验:链表六有序链表的建立

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
};
int main()
{
    struct node *head, *p, *tail, *q;
    int n, i, t;
    scanf("%d", &n);
    head = (struct node *)malloc(sizeof(struct node));
    head->next = NULL;
    tail = head;
    for(i = 1; i <= n; i  )
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d", &p->data);
        p->next = NULL;
        tail->next = p;
        tail = p;
    }
   for(p = head->next; p != NULL; p = p->next)
   {
       for(q = p->next; q != NULL; q = q->next)
       {
           if(p->data > q->data)
           {
               t = q->data;
               q->data = p->data;
               p->data = t;
           }
       }
   }
    for(p = head->next; p->next != NULL; p = p->next)
    {
        printf("%d ", p->data);
    }
    printf("%d\n", p->data);
    return 0;
}