一元多项式的代数运算网上的程序里有term* selsort(term *h) { term *g, *p, *q; if(!h) return NULL; float f; int i, fini = 1; for(g = h;g->next&&fini;g = g->next) { fini = 0; for(p = h,q = h->next;q;p = p->next,q = q->next) if (p->expn <

来源:学生作业帮助网 编辑:作业帮 时间:2024/04/29 03:28:16
一元多项式的代数运算网上的程序里有term* selsort(term *h) { term *g, *p, *q; if(!h) return NULL; float f; int i, fini = 1; for(g = h;g->next&&fini;g = g->next) { fini = 0; for(p = h,q = h->next;q;p = p->next,q = q->next) if (p->expn <
xJ@_eHZ#}q̤M'iz**^hۢPwMŗ-[ Eۓ̙/p{3LK; Sz?ţߣɸ>AZuRƞ@Z@~,MPEޚk9Jm,`˶@Rj& МبMN2̰Sd( @wط@O\qb  Al`Kns˗ -hWHG8;B«0?Ӿ45%b"zrO֩uNG91tǂd 6r?N j~ eazS:5X1lL.I.BSOIW1D{a6-T" 5'Anct `'jGͮ.

一元多项式的代数运算网上的程序里有term* selsort(term *h) { term *g, *p, *q; if(!h) return NULL; float f; int i, fini = 1; for(g = h;g->next&&fini;g = g->next) { fini = 0; for(p = h,q = h->next;q;p = p->next,q = q->next) if (p->expn <
一元多项式的代数运算
网上的程序里有
term* selsort(term *h) {
term *g, *p, *q;
if(!h) return NULL;
float f;
int i, fini = 1;
for(g = h;g->next&&fini;g = g->next) {
fini = 0;
for(p = h,q = h->next;q;p = p->next,q = q->next)
if (p->expn < q->expn) {
f = p->coef;i = p->expn;
p->coef = q->coef;p->expn = q->expn;
q->coef = f;q->expn = i;
fini = 1;
}
}
for(g = h,p = g->next;p;)
if(g->expn==p->expn) {
g->coef += p->coef;
g->next = p->next;
q = p;
p = p->next;
free(q);
}
else if(g->next) {
g = g->next;
p = p->next;
}
return h;
}
这样一个函数,请问selsort是什么意思,函数的作用是什么

一元多项式的代数运算网上的程序里有term* selsort(term *h) { term *g, *p, *q; if(!h) return NULL; float f; int i, fini = 1; for(g = h;g->next&&fini;g = g->next) { fini = 0; for(p = h,q = h->next;q;p = p->next,q = q->next) if (p->expn <
函数调用
调用的下面的函数体