#include<stdio.h>
#include<malloc.h>
void *insret(struct aaa **head,struct aaa *p0);
void print(struct aaa *p);
#define LEN sizeof(struct aaa)
#define NULL 0
struct aaa
{
    int num;
    struct aaa *next;
};
void main()
{
    struct aaa *p1,*p2,*head,*p0;
    int n=0;
    p1=p2=(struct aaa *)malloc(LEN);
    head=NULL;
    scanf("%d",&p1->num);
    while(p1->num!=0)
    {
        n++;
        if(n==1)
            head=p1;
        else p2->next=p1;
        p2=p1;
        p1=(struct aaa *)malloc(LEN);
        scanf("%d",&p1->num);
    }
    p2->next=NULL;
    p0=(struct aaa *)malloc(LEN);
    printf("please p0");
    scanf("%d",&p0->num);

    insret(&head,p0);
    print(head);
    }
void *insret(struct aaa **head,struct aaa *p0)
{
    struct aaa *p1,*p2;
    p1=*head;
    if(head==NULL)
    {
        *head=p0;
        p0->next=NULL;
    }
    else
        while((p0->num > p1->num) && (p1->next!=NULL))
        {
            p2=p1;
            p1=p1->next;
        }
        if(p1->num >= p0->num)
        {
            if(*head==p1)
                *head=p0;
            else p2->next=p0;
            p0->next=p1;
        }
        else
        {
            p1->next=p0;
            p0->next=NULL;
        }
        return head;
}
void print(struct aaa *p)
{
    struct aaa *r;
    int k=0;
    r=p;
    while(r!=NULL)
    {
        k++;
        printf("%d  %d\n",k,r->num);
        r=r->next;
    }
}

楼主弄一个链表都要用双重指针。。。把简单问题复杂化了

void *insret(struct aaa **head,struct aaa *p0)
{
    struct aaa *p1,*p2;
    p1=*head;
    if(head==NULL)
    {
        *head=p0;
        p0->next=NULL;
        return;
    }
    else
   {
        while((p0->num > p1->num) && (p1->next!=NULL))
        {
            p2=p1;
            p1=p1->next;
        }
        if(p1->num >= p0->num)
        {
            if(*head==p1)
                *head=p0;
            else p2->next=p0;
            p0->next=p1;
        }
        else
        {
            p1->next=p0;
            p0->next=NULL;
        }
        return head;
    }
}

我先说句，你这样真的小题大做了，太麻烦了，我运行的可以插入呢？你看看；
#include<stdio.h>
#include<malloc.h>
void *insret(struct aaa **head,struct aaa *p0);
void print(struct aaa *p);
#define LEN sizeof(struct aaa)
#define NULL 0
struct aaa
{
    int num;
    struct aaa *next;
};
void main()
{
    struct aaa *p1,*p2,*head,*p0;
    int n=0;
    p1=p2=(struct aaa *)malloc(LEN);
    head=NULL;
    scanf("%d",&p1->num);
    while(p1->num!=0)
    {
        n++;
        if(n==1)
            head=p1;
        else p2->next=p1;
        p2=p1;
        p1=(struct aaa *)malloc(LEN);
        scanf("%d",&p1->num);
    }
    p2->next=NULL;
    p0=(struct aaa *)malloc(LEN);
    printf("please p0");
    scanf("%d",&p0->num);

    insret(&head,p0);
    print(head);
    }
void *insret(struct aaa **head,struct aaa *p0)
{
    struct aaa *p1,*p2;
    p1=*head;
    if(head==NULL)
    {
        *head=p0;
        p0->next=NULL;
    }
    else
        while((p0->num > p1->num) && (p1->next!=NULL))
        {
            p2=p1;
            p1=p1->next;
        }
        if(p1->num >= p0->num)
        {
            if(*head==p1)
                *head=p0;
            else p2->next=p0;
            p0->next=p1;
        }
        else
        {
            p1->next=p0;
            p0->next=NULL;
        }
        return head;
   
}
void print(struct aaa *p)
{
    struct aaa *r;
    int k=0;
    r=p;
    while(r!=NULL)
    {
        k++;
        printf("%d  %d\n",k,r->num);
        r=r->next;
    }
}

多谢您抽时间帮忙，小弟是新手，还处于练习阶段，不晓得如何简单，还请赐教

多谢您抽时间回复，能否交个朋友 我QQ316928512