（1）顺序存储结构的实现。

列如，已知：

f(x)=8x^6+5x^5-10x^4+32x^2-x+10,g(x)=7x^5+10x^4-20x^3-10x^2+x,

求和结果：f(x)+g(x)=8x^6+12x^5-20x^3+22x^2+10。

顺序表数据类型定义如下：

#define MAXLEN 100

typedef struct

{ int data[MAXLEN]

int last

}SeqList

（2）链式存储结构的实现

列如，已知：

f(x)=100x^100+5x^50-30x^10+10,g(x)=150x^90-5x^50+40x^20+20x^10+3x,

求和结果：f(x)+g(x)=100x^100+150x^90+40x^20-10x^10+3x+10。

（3）编程实现多项式求和的运算。

-(1) the realization of the sequential storage structure.

Such as, known:

F (x) = 8 x ^ ^ 6+ 5 x 5-10 x ^ 4+ x ^ 2-32 x+ 10, g (x) = 7 x ^ ^ 5+ 10 x 4-20 x ^ 3-10 x ^ 2+ x,

Sum the results: f (x)+ g (x) = 8 x ^ ^ 6+ 12 x 5　20 x ^ 3+ x ^ 2+ 10.

The order table data types are defined as follows:

# define MAXLEN. 100

Typedef struct

{int data [MAXLEN]

Int last

} SeqList

(2) the implementation of the chain store structure

Such as, known:

F (x) = 100 100+ 5 x x ^ ^- 30 x ^ 10+ 10, 50 g (x) = 150, 90-5 x x ^ ^ 50+ 20+ 20 x 40 x ^ ^ 10+ 3 x.

Sum the results: f (x)+ g (x) = 100+ 150 x 100 x ^ ^ 90+ x ^ 20-40 x 10 ^ 10+ 3+ 10 x.

(3) polynomial summation calculations by programming.