一元多项式加减乘除源代码（One dollar polynomial adds and subtracted the source code）.docVIP

下载本文档

18
0
约1.31万字
约 31页
2017-07-21 发布于河南
举报
版权申诉

一元多项式加减乘除源代码（One dollar polynomial adds and subtracted the source code）.doc

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

一元多项式加减乘除源代码（One dollar polynomial adds and subtracted the source code）

一元多项式加减乘除源代码（One dollar polynomial adds and subtracted the source code） / / Polynomial_list / / function: input two polynomials (do not be in the ascending order, the program will automatically merge the same type and sort), and add and subtract multiplication and division operations # include stdio, h # include stdlib. H H # include math.h / / node definition Typedef struct PolyNode { Int exp. / / index Float coef. / / coefficient PolyNode * next; } PolyNode, * PolyList; / / function declaration PolyList CreatePolyList (); / / create a polynomial list and return a pointer Void DisplayPolyList (PolyList Poly real); / / display polynomial Void DestroyPolyList PolyList (L); / / release list of storage space Void MergePoly (PolyList Poly real); / / the polynomial and the same category Void SortPoly (PolyList Poly real); / / arrange the polynomial in ascending order PolyList PolyList PolyB, PolyList PolyB, PolyList PolyList PolyB / / polynomials, return and polynomial chain headers PolyList PolySub (PolyList polya, PolyList polyb); / / polynomials, return differential polynomial chain header pointer PolyList PolyA, PolyList PolyB. / / polynomials, the results are returned by PolyC PolyList PolyDivide (PolyList PolyA, PolyList PolyB); / / polynomials, the results are stored in PolyC, separated by nodes with coefficients of 0 / / function implementation / / create a polynomial list and return a pointer PolyList CreatePolyList () { Rear PolyNode * s, * and * head; Int e; / / index Float c; / / coefficient Int n = 1; / / counter Head = (PolyNode *) malloc (sizeof (PolyNode)); Rear = head; / / the coefficient and exponent of the input polynomial, if the input coefficient is 0 Printf ( please enter the coefficients and indexes of the first % d terms of the polynomials (separated by commas) : , n+ +); Scanf ( % f, % d , c, e); While (fabs (c) 1 e - 6) {s = (PolyNode *) malloc (PolyNode); S - exp = e; S - coef = c; Rear - next = s; Rear = s; Printf ( please enter th