//实现在输入时自动排序(由小到大)
PNode *CreateList(int n)
{
Polynomia P;
PNode *pre,*q,*s;
P=(Polynomia)(malloc(sizeof(PNode)));
P->next=NULL;
int i;
printf("Enter coef and expn(共%d组): ",n);
for(i=0;i<n;i++)
{
pre=P;
q=P->next;
s=(Polynomia)(malloc(sizeof(PNode)));
scanf("%d%d",&s->coef,&s->expn);
while(q && q->expn<s->expn)
{
pre=q;
q=q->next;
}
s->next=q;
pre->next=s;
}
return P;
}
使用单链表实现在输入时对数据进行排序(由小到大)
猜你喜欢
转载自blog.csdn.net/Huayra221/article/details/81126046
今日推荐
周排行