一元多项式的代数运算网上的程序里有term* selsort(term *h) { term *g, *p, *q; i
来源:学生作业帮 编辑:搜搜做题作业网作业帮 分类:综合作业 时间:2024/07/05 13:28:20
一元多项式的代数运算
网上的程序里有
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 < 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; i](/uploads/image/z/7650705-57-5.jpg?t=%E4%B8%80%E5%85%83%E5%A4%9A%E9%A1%B9%E5%BC%8F%E7%9A%84%E4%BB%A3%E6%95%B0%E8%BF%90%E7%AE%97%E7%BD%91%E4%B8%8A%E7%9A%84%E7%A8%8B%E5%BA%8F%E9%87%8C%E6%9C%89term%2A+selsort%28term+%2Ah%29+%7B+term+%2Ag%2C+%2Ap%2C+%2Aq%3B+i)
函数调用
调用的下面的函数体
再问: 能详细说说吗,刚学不太明白。下面的是显示多项式的函数
调用的下面的函数体
再问: 能详细说说吗,刚学不太明白。下面的是显示多项式的函数