Description: 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.
To Search:
File list (Check if you may need any files):
多项式.cpp
Download