对已知的多项式p(x)利用用线性表的数据结构进行加法，乘法，微商运算

加法的时间复杂度为O(n+m)

乘法的时间复杂度为O(nm)

微分的时间复杂度为O(n)

排序的平均时间复杂度为O(nlogn)

程序优点：通过顺序表和链表结合使用，使乘法合并同类项的时间复杂度降为O(1)，乘法本身的时间复杂度也达到下界。

程序提供了有好的界面，并且有较好的容错性，输入输出人性化，符合人的习惯。

用快速排序代替了插入排序，使本程序能应对较大的数据。

程序缺点：系数和指数有范围限制，在某种意义上算不上解决了问题。可以引入哈希函数解决这个问题

由于运用的是顺序表，浪费了大量的空间，牺牲了空间来换取时间。

-Known polynomial p (x) using the linear form of data structure addition, multiplication, derivative operations



Addition of time complexity O (n+ m)



Multiplication of the time complexity of O (nm)



Differential and time complexity O (n)



Sort of average time complexity is O (nlogn)



Program benefits: by order of tables and lists, in combination, to the multiplication of similar items of the merger reduced the time complexity of O (1), the time complexity of multiplication itself also reached the lower bound.



Program provides a good interface, and better fault tolerance, human input and output in line with people s habits.



Instead of using quick sort insertion sort, so the program can deal with large data.



Program Disadvantages: limited range of factors and indices, in a sense not really solve the problem. Ruha Xi function can lead to solve this problem



Because we use the order form, wasting a lot of space, at the expense of space for time.