直接插入排序链表表示

#include <stdio.h>
#include <stdlib.h>
#define LENGTH 5
typedef struct node{
    int data;
    struct node *next;
}pNode,* TNode;

void Insert_sort(TNode &head,int num) //插入链表，并进行排序
{
    static int i=1;                        //第一个元素无需排序直接插入链表
    pNode *p,*q,*temp;
    p=(pNode*)malloc(sizeof(pNode));
    p->data=num;
    q=head->next;
    if(i==1)
    {
        p->next=head->next;
        head->next=p;
    }
    else
    {
        while (q!=NULL)
        {
            if(p->data<=q->data)
            {
                p->next=q;
                if (q==head->next)
                    head->next=p;
                else
                    temp->next=p;
                break;
            }
            else
            {
                temp=q;
                q=q->next;
            }
        }
        if(q==NULL)
        {
            p->next=temp->next;
            temp->next=p;
        }
    }
    i++;
}

void Disp(pNode *head)//显示链表
{
    pNode *p;
    p=head->next;
    while(p!=NULL)
    {
        printf("%4d",p->data);
        p=p->next;
    }
    printf("\n");
}

void search(pNode *head,int num)//查找一个元素
{
    pNode *p;
    int i=1;
    p=head->next;

    while(p!=NULL)
    {
        if(p->data==num)
            break;
        else
        {
            p=p->next;
            i++;
        }
    }
    if(p==NULL)
        printf("the num is not exit!\n");
    else
        printf("the %d 's position is：%d\n",num,i);
}

void del(TNode head,int num) //删除其中一个元素
{
    TNode temp,p;
    p=head->next;
    while (p!=NULL)
    {
        if (p->data==num)
        {
            if(head->next==p)
                head->next=p->next;
            else
            {
                temp->next=p->next;
            }
            break;
        }
        else
        {
            temp=p;
            p=p->next;
        }
    }
    if(p==NULL)
        printf("the number is not exit!\n");
    else
    {
        printf("delete success!\n");
        free(p);
    }
}

int main()
{
    pNode *head;
    int i,num;
    head=(pNode *)malloc(sizeof(pNode));            //创建一个头结点
    head->next=NULL;
    printf("    input a number:\n");
    for (i=0;i<LENGTH;i++)
    {
        scanf("%d",&num);
        Insert_sort(head,num);
    }
    Disp(head);
    printf("please input a num to search:");
    scanf("%d",&num);
    search(head,num);
    printf("please input a num to delete:");
    scanf("%d",&num);
    del(head,num);
    Disp(head);
}