这个程序最后是把连接好的两个链表按照num的值排了序，但是我的这个代码没有排序，我试着排了序但排不出来，所以下面这个代码没有排序的代码，还请大神教教我

#include<stdio.h>
#include<malloc.h>

#define LEN sizeof(struct student)

int sum = 0;
/* User Code Begin(考生可在本行后添加代码，定义程序中使用的结构体类型、声明自定义函数的原型，行数不限) */
struct student
{
    int num;
    int score;
    struct student *next;
};

struct student *creat(void);
struct student *merge(struct student *ahead, struct student *bhead);

/* User Code End(考生添加代码结束) */

/* print以规定的格式完成遍历显示指定的链表 */
void print(struct student *Head);

int main(void)
{
    struct student *ah, *bh, *ac;
    
    printf("创建链表A，请输入学号及成绩(均输入为0时表示停止)：\n");
    ah = creat();
    printf("\n创建链表B，请输入学号及成绩(均输入为0时表示停止)：\n");
    bh = creat();

    printf("\n链表A：");
    print(ah);
    printf("\n链表B：");
    print(bh);
    
    ac = merge(ah, bh);
    printf("\n两个链表共有%d个人\n链表C：", sum);
    print(ac);
    
    return 0;
}

void print(struct student *Head)
{
    while (Head != NULL)
    {
        printf("%d,%d  ", Head->num, Head->score);
        Head = Head->next;
    }
}

/* User Code Begin(考生在此后完成自定义函数的设计，行数不限) */
struct student *creat(void)
{
    struct student *head;
    struct student *p1, *p2;
    int num = 0;
    
    sum++;
    printf("学生 %d: ", sum);
    p1 = p2 = (struct student *)malloc(LEN);
    scanf("%d %d", &p1->num, &p1->score);
    head = NULL;
    while (p1->num != 0)
    {
        num++;
        sum++;
        if (num == 1)
        {
            head = p1;
        }
        else
        {
            p2->next = p1;
            p2 = p1;
        }
        printf("学生 %d: ", sum);
        p1 = (struct student *)malloc(LEN);
        scanf("%d %d", &p1->num, &p1->score);
    }
    p2->next = NULL;
    sum--;

    return head;
}

struct student *merge(struct student *ahead, struct student *bhead)
{
    struct student *p1,*p2=NULL;
    int i=0;
    
    p1 = ahead;
    if (sum == 0)
    {
        return NULL;
    }
    else if (ahead == NULL)
    {
        return bhead;
    }
    else if (bhead == NULL)
    {
        return ahead;
    }
    else
    {
        while (p1->next != NULL)
        {
            p1 = p1->next;
        }
        p1->next = bhead;
    }
    
    return ahead;
}

用冒泡排序即可，很简单的，just do it！

链表排序帮你写好了

#include<stdio.h>
#include<malloc.h>

#define LEN sizeof(struct student)

int sum = 0;
/* User Code Begin(考生可在本行后添加代码，定义程序中使用的结构体类型、声明自定义函数的原型，行数不限) */
struct student

 {
     int num;
     int score;
     struct student *next;

 };

struct student *creat(void);
struct student *merge(struct student *ahead, struct student *bhead);

/* User Code End(考生添加代码结束) */

/* print以规定的格式完成遍历显示指定的链表 */
void print(struct student *Head);

struct student *partion(struct student *a){

 struct student *b,*c,*d,*pre;

 int i,j,corenum=0;

 b=a->next;

 while(b!=NULL){
    corenum++;
    b=b->next;

 }

 //printf("%d",corenum);


 b=a->next;


 for(i=0;i<corenum-1;i++){
  b=a->next;
  pre=a;
  for(j=corenum-i-1;j;j--){
   if(b->num>b->next->num){
    c=b->next;
    b->next=b->next->next;
    c->next=b;
    pre->next=c;
    pre=c;
   }
   else{
    pre=b;
    b=b->next;

   }
  }

 }

  return a;
}

int main(void)

 {
     struct student *ah, *bh, *ac;

     printf("创建链表A，请输入学号及成绩(均输入为0时表示停止)：\n");
     ah = creat();
     printf("\n创建链表B，请输入学号及成绩(均输入为0时表示停止)：\n");
     bh = creat();

     printf("\n链表A：");
     print(ah);
     printf("\n链表B：");
     print(bh);

     ah=partion(ah);
     bh=partion(bh);
     ac = merge(ah, bh);
     printf("\n两个链表共有%d个人\n链表C：", sum);
     print(ac);

     return 0;

 }

void print(struct student *Head)

 {
     struct student *Head1;
     Head1=Head->next;
     while (Head1 != NULL)
     {
         printf("%d,%d  ", Head1->num, Head1->score);
         Head1 = Head1->next;
     }


 }

/* User Code Begin(考生在此后完成自定义函数的设计，行数不限) */
struct student *creat(void)

 {
     struct student *head;
     struct student *p1, *p2;
     int num = 0;

     head= (struct student *)malloc(LEN);

     sum++;
     printf("学生 %d: ", sum);
     p1 = p2 = (struct student *)malloc(LEN);
     scanf("%d %d", &p1->num, &p1->score);

     //head = NULL;
     while (p1->num != 0)
     {
         num++;
         sum++;

         if (num == 1)
         {
             head ->next= p1;
         }
         else
         {
             p2->next = p1;
             p2 = p1;
         }
         printf("学生 %d: ", sum);
         p1 = (struct student *)malloc(LEN);
         scanf("%d %d", &p1->num, &p1->score);
     }
     p2->next = NULL;
     sum--;

     return head;

 }

struct student *merge(struct student *ahead, struct student *bhead)

 {
     struct student *p1,*p2,*chead,*p3;


     p1 = ahead;
     chead= (struct student *)malloc(LEN);
     chead->next=NULL;
     p3=chead;
     p1=ahead->next;
     p2=bhead->next;
     while((ahead->next!=NULL)&&(bhead->next!=NULL)){
        if(p1->num<p2->num){
            ahead->next=p1->next;
            p3->next=p1;
            p3=p1;
            p1=ahead->next;

        }
        else{
            bhead->next=p2->next;
            p3->next=p2;
            p3=p2;
            p2=bhead->next;

        }
     }
     if(ahead->next!=NULL) p3->next=ahead->next;
     else p3->next=bhead->next;


     return chead;

 }

#include<stdio.h>
#include<malloc.h>

#define LEN sizeof(struct student)

int sum = 0;
/* User Code Begin(考生可在本行后添加代码，定义程序中使用的结构体类型、声明自定义函数的原型，行数不限) */
struct student
{
    int num;
    int score;
    struct student *next;
};

struct student *creat(void);
struct student *sort(struct student *ahead);
struct student *merge(struct student *ahead, struct student *bhead);

/* User Code End(考生添加代码结束) */

/* print以规定的格式完成遍历显示指定的链表 */
void print(struct student *Head);

int main(void)
{
    struct student *ah, *bh, *ac;
    
    printf("创建链表A，请输入学号及成绩(均输入为0时表示停止)：\n");
    ah = creat();
    printf("\n创建链表B，请输入学号及成绩(均输入为0时表示停止)：\n");
    bh = creat();

    printf("\n链表A：");
    print(ah);
    printf("\n链表B：");
    print(bh);
    
    ac = merge(ah, bh);
    printf("\n两个链表共有%d个人\n链表C：", sum);
    print(ac);
    printf("\n开始排序。。。");
    ac=sort(ac);
    printf("\n排序后：");
    print(ac);
   
    return 0;
}

 student *sort(struct student *ac){
     struct student *h=(struct student*)malloc(sizeof(struct student));
     h->next=ac; 
    for(struct student *p=h->next,*pr=h,*pp=p;p;){
        pr=h;
        while(pr->next!=p)pr=pr->next;
        pp=pp->next;
        for(struct student *q=h->next,*qr=h;q!=p;q=q->next,qr=qr->next){
            if(p->num<q->num){
                pr->next=p->next;
                p->next=q; 
                qr->next=p;
                break; 
            }
        } 
        p=pp;
    }
    return h->next;
}
void print(struct student *Head)
{
    while (Head != NULL)
    {
        printf("%d,%d  ", Head->num, Head->score);
        Head = Head->next;
    }
}

/* User Code Begin(考生在此后完成自定义函数的设计，行数不限) */
struct student *creat(void)
{
    struct student *head;
    struct student *p1, *p2;
    int num = 0;
    
    sum++;
    printf("学生 %d: ", sum);
    p1 = p2 = (struct student *)malloc(LEN);
    scanf("%d %d", &p1->num, &p1->score);
    head = NULL;
    while (p1->num != 0)
    {
        num++;
        sum++;
        if (num == 1)
        {
            head = p1;
        }
        else
        {
            p2->next = p1;
            p2 = p1;
        }
        printf("学生 %d: ", sum);
        p1 = (struct student *)malloc(LEN);
        scanf("%d %d", &p1->num, &p1->score);
    }
    p2->next = NULL;
    sum--;

    return head;
}

struct student *merge(struct student *ahead, struct student *bhead)
{
    struct student *p1,*p2=NULL;
    int i=0;
    
    p1 = ahead;
    if (sum == 0)
    {
        return NULL;
    }
    else if (ahead == NULL)
    {
        return bhead;
    }
    else if (bhead == NULL)
    {
        return ahead;
    }
    else
    {
        while (p1->next != NULL)
        {
            p1 = p1->next;
        }
        p1->next = bhead;
    }
    
    return ahead;
}