程序代码：

typedef struct st
{
    char name[50];
    int score;
    struct st *pnext;
}SC, *PSC;

/*排序函数*、
void sort(PSC phead)
{
    PSC p, s, t;
    int i, n, j;
    if ((p=phead->pnext)==NULL||(s=p->pnext)==NULL)
    {
        exit(0);
    }

    t = phead;
    for (i=1; i<cnt; i++)
    {
        p = phead->pnext;
        t = phead;
        for (j=0; j<cnt-i; j++)
        {
            s = p->pnext;
            if (p->score > s->score)
            {
                t->pnext = s;
                p->pnext = s->pnext;
                s->pnext = p;
                s = p;            
                p = t->pnext;      
            }
            t = p;
            p = s;
        }
    }
    p = phead;
    while(p!= NULL)
    {
        printf("\t\t\t%s\t\t%d\n", p->name, p->score);
        p = p->pnext;
    }
    system("pause");

}

程序代码：

typedef struct st
{
    char name[50];
    int score;
    struct st *pnext;
}SC, *PSC;
/*排序函数*/
void sort(PSC phead)
{
    PSC p, s, t;
    int i, n, j;
    if ((p=phead->pnext)==NULL||(s=p->pnext)==NULL)
    {
        exit(0);
    }

    t = phead;
    for (i=1; i<cnt; i++)
    {
        p = phead->pnext;
        t = phead;
        for (j=0; j<cnt-i; j++)
        {
            s = p->pnext;
            if (p->score > s->score)
            {
                t->pnext = s;
                p->pnext = s->pnext;
                s->pnext = p;
                s = p;            
                p = t->pnext;      
            }
            t = p;
            p = s;
        }
    }
    p = phead;
    while(p!= NULL)
    {
        printf("\t\t\t%s\t\t%d\n", p->name, p->score);
        p = p->pnext;
    }
    system("pause");

}

程序代码：

void sort(PSC phead)        //链表的排序
{    
    PSC p1,p2, p3,p;
    p1=p2=phead;
    while(p1 ->pnext != NULL)
    {
        p3 = p1->pnext;
        if(p1->score < p3->score)
        {
            p2=p1->pnext;  
            p1->pnext=p2->pnext;  
            p2->pnext=p1;
            p2=p1;
        }
        else
        {
            p2=p1=p1->pnext;  
        }
    }

    p = phead;   // 输出
    while(p!= NULL)
    {
        printf("\t\t\t%s\t\t%d\n", p->name, p->score);
        p = p->pnext;
    }
    system("pause");
}

程序代码：

void sort(PSC phead)        //链表的排序
{    
    PSC p1, p2,p3,p4,p;
    p1=phead;
int td;
char tc[50];
p2 = p1->pnext;
p3 = (PSC)malloc(sizeof(SC));
while(p1->pnext != NULL)
{
p1 = p1->pnext;
}
p4 = p1;
p1->pnext = p3;
p3->pnext = NULL;

p1=phead;
     do
    {
p2 = p1;
while(p2->pnext != NULL)
{
if(p1->score < p2->score)
{
td = p1->score;
p1->score = p2->score;
p2->score = td;
strcpy(tc, p1->name);
strcpy(p1->name, p2->name);
strcpy(p2->name, tc);
}
p2 = p2->pnext;
}
p1 = p1->pnext;
    }while(p1->pnext != NULL);
p4->pnext = NULL;
free(p3);

p = phead;   // 输出
printf("\n\t\t排序后：\n");
while(p!= NULL)
{
printf("\t\t\t%s\t\t%d\n", p->name, p->score);
p = p->pnext;
}
system("pause");
}

void  exit0(PSC phead)
{
PSC p1, p2;    
p1=phead;
while( p1!=NULL)
{    p2=p1->pnext;
free(p1);
p1=p2;
}
}