Welcome![Sign In][Sign Up]
Location:
Search - polynomial linked list

Search list

[Data structsLink_list

Description: 用链表实现多项式的加法与乘法,链表是采用数据结构里面的单链表-polynomial with the addition and multiplication, linked list data structure is used inside the single-linked list
Platform: | Size: 1024 | Author: 混子杨 | Hits:

[Data structsassignment_1

Description: 用C++写的两个多项式相加,但可在C下实现,只用将#define NULL 0 去掉就可以了.是用单向链表实现-Using C to write the sum of two polynomials, but can be achieved in C, only to# define NULL 0 to remove it. Is the realization of a one-way linked list
Platform: | Size: 1024 | Author: liu jing | Hits:

[Data structshomework2_2

Description: 用链表(单向链表或双向链表)实现 多项式之间的运算包括:多项式之间的加、减、乘、除*法等 -Use linked lists (one-way or two-way linked list) between the computing polynomial realize include: polynomial between the add, subtract, multiply, divide, etc.* Act
Platform: | Size: 35840 | Author: 云从龙 | Hits:

[Data structspolynomial

Description: 数据结构中用链表实现的多项式的加法,减法,乘法的程序。-Linked list data structure used to achieve the polynomial addition, subtraction, multiplication procedure.
Platform: | Size: 296960 | Author: beastman | Hits:

[Windows Developpolynomial

Description: 在VC6.0环境下,链表实现了多项式的基本操作:创建、销毁、两多项式的和(差、乘积)、求多项式的导数、求多项式的值等。文件中不仅包含源码 ,还包含一组测试结果。-At VC6.0 environment, the linked list implementation of the polynomial basic steps: create, destroy, the two polynomials and (bad, the product), and derivatives of polynomial, and the value of such polynomials. Document not only contains the source code, but also contains a set of test results.
Platform: | Size: 9216 | Author: shuiyeshan | Hits:

[Data structspoly

Description: 一元多项式的加、减、乘、除法,用链表存储多项式的每一个结点-Polynomial plus one dollar, subtraction, multiplication, division, polynomial using linked list storage of each node
Platform: | Size: 1024 | Author: jfly | Hits:

[Otherpolynomial-

Description: 一元多项式相加减 #include<stdio.h> #include<malloc.h> typedef struct polynode /*用单链表存储多项式的结点结构*/ { int coef int exp struct polynode *next }node-Unary polynomial-phase addition and subtraction# include <stdio.h># include <malloc.h> typedef struct polynode/* single linked list node structure stored polynomial*/(int coef int exp struct polynode* next ) node
Platform: | Size: 1024 | Author: 张朗 | Hits:

[Data structspolynomial

Description: 利用链表解决合并两个多项式的问题,最后按格式输出多项式-Combine two polynomials using linked list, then format printing
Platform: | Size: 357376 | Author: LuJun | Hits:

[Data structspolynomial

Description: 利用链表的多项式运算,数据结构的相关知识-Polynomial operations using linked list data structure knowledge
Platform: | Size: 1252352 | Author: 王全俊 | Hits:

[Data structspolynomial

Description: 一元多项式相加,创建单链表操作,然后用单链表返回值-Of Multinomial added together, create a single list operation, then the return value with a single linked list
Platform: | Size: 195584 | Author: yesmylord | Hits:

[Data structsUnary-polynomial-operations-(list)

Description: 利用单链表实现一元多项式的加、减、乘法,含有开辟多项式所需空间、判断用户输入正确与否、构造节点存放多项式系数和指数、构造多项式、多项式整理(按指数从小到大存放)、撤销多项式所在节点、合并同类项、多项式加法、多项式减法、多项式乘法、多项式长度计算等。-Using a single linked list to achieve a polynomial addition, subtraction, multiplication
Platform: | Size: 86016 | Author: Mr Li | Hits:

[Mathimatics-Numerical algorithmslinked-list-polynomial-sum

Description: 用链表表示一元多项式,写一算法完成两个一元多项式相加。-Represents a polynomial with a linked list, write an algorithm to complete two one-polynomial sum.
Platform: | Size: 318464 | Author: newthursday | Hits:

[Data structspolynomial

Description: 一元多项式的运算,链表实现,数据结构基本内容。-A polynomial operations, linked list implementation, the basic content of the data structure
Platform: | Size: 17408 | Author: 流川天 | Hits:

[Data structspolynomial-with-linked-list

Description: 能够实现任意项有理多项式的加、减、乘、除、求模以及幂运算-Able to achieve any item rational polynomial plus, subtract, multiply, and exponentiation
Platform: | Size: 9216 | Author: wu ting | Hits:

[Otherpolynomials

Description: 计算两个多项式的加法,减法以及乘法,多项式的通过链表存储。-Calculation of two polynomials of addition, subtraction, and multiplication, and polynomial linked list storage.
Platform: | Size: 2048 | Author: 欧阳文俊 | Hits:

[OS Developrequire-the-use-of-a-linked-

Description: 题目说明:   要求采用链表形式,求两个一元多项式的乘积:h3 = h1*h2。函数原型为:void multiplication( NODE * h1, NODE * h2, NODE * h3 )。 输入:   输入数据为两行,分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数(整数)、指数(整数)。   例如:1+2x+x2表示为:<1,0>,<2,1>,<1,2>, 输出:   以指数递增的顺序输出乘积: <系数,指数>,<系数,指数>,<系数,指数>,   零多项式的输出格式为:<0,0>, -Topic: require the use of a linked list, find the the two unary polynomial.: H3 = h1* h2. The function prototype: void multiplication (NODE* h1, NODE* h2, NODE* h3). Input: The input data for the two lines, respectively, said two unary polynomial. $ 1 each polynomial exponential order of increasing input polynomial the coefficient (integer) index (integer). For example: 1+2x+x2 said: < 1,0> , < 2,1> , < 1,2> , the output: output to the index in order of increasing product: < coefficient index> < factor, index> , < coefficient, the index The zero polynomial output format: < 0,0> ,
Platform: | Size: 2048 | Author: xy | Hits:

[Otherpolynomial

Description: 实验需要,一个多项式相加,一个多项式相乘,用代表头的非循环的单链表完成-Experimental needs, a polynomial, a polynomial multiplication, on behalf of head acyclic singly linked list is complete
Platform: | Size: 3072 | Author: zky | Hits:

[Otherpolynomial-arithmetic

Description: 这个程序利用从文件读取数据(每组系数和指数以实数对形式括在一起输入,以逗号隔开,以#结束输入),建立多项式链表,进行多项式计算(加减乘以及微分),最后将多项式输出至文件中保存。-Use this procedure to read data from a file (each coefficient and index to the real number of the form, including input together, separated by a comma, followed by# input), the establishment of a polynomial linked list polynomial (subtraction, multiplication and differentiation), and finally the polynomial output to a file saved.
Platform: | Size: 305152 | Author: 任强 | Hits:

[CSharpSparse-polynomial-calculations

Description: 稀疏多项式计算,包括加减乘除,利用单向链表完成-Sparse polynomial calculations, including addition, subtraction, completion of the one-way linked list
Platform: | Size: 219136 | Author: Aaron | Hits:

[Software Engineering1

Description: 将两个一元n次多项式相加,并输出相加后的新的一元n次多项式 (1) 从input.txt文件读入一元多项式的系数和指数,用尾插法建立一元多项式的链 表。 (2) 以输入系数0为结束标志。 (3) 并约定建立多项式链表时,总是按指数从小到大的顺序排列。 (4) 要求借鉴第一章课件中给出的编程思路,一元多项式链表采用带头结点的单链表 实现。-The two one yuan polynomial of degree n, and outputs the added new one yuan polynomial of degree n (1) from input.txt file is read into one yuan polynomial coefficients and indices, with the tail establish a polynomial interpolation of the list. (2) to enter the coefficient 0 to end flag. (3) They agreed to establish polynomial linked list is always exponentially small to large order. (4) requires learning courseware given in the first chapter programming ideas, one yuan polynomial linked list nodes using the lead single linked list implementation.
Platform: | Size: 1285120 | Author: miyor | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net