我已经想出来
根据静态链表的冒泡排序法的思想进行拓展的!
struct LOND{
ElemType data;
struct LOND *font;
sttuct LOND *next;
};
typedef LOND struct List;

List *taxis(*head){
int c,t;
c=0;

typedef LOND struct *p;
typedef LOND struct *s;
do{
for(s=head,t=c,p=s->next;s->next=NULL;p=s->next)
{
if(p.data<s.data)
{
if(s==head)
{
s->next=p->next;
p->next->font=s;
p->next=s;
p=s->font;
p->font=NULL;
head=p;
}
else
{
s->next=p->next;
p->next->font=s;
p->next=s;
p->font=s->font;
s->font->next=p;
p=s->font;
}
c++;
}
else
{
s=p;
p=p->next;
}
}
}while(c!=t)

}