Question: Prob: Using sequential and dynamic list to implement the Addition, Substraction,or Multiplication of two unary polynomials. For A m (x) and B n (x). A
Prob: Using sequential and dynamic list to implement the Addition, Substraction,or Multiplication of two unary polynomials.
For Am(x) and Bn(x).
Am(x)=A0+A1x1+A2x2+A3x3+ +Amxm
Bn(x)=B0+B1x1+B2x2+B3x3+ +Bnxn
Please use program to solve M(x)= Am(x)+Bn(x), M(x)= Am(x)-Bn(x) and M(x)= Am(x)Bn(x).
Requirements
1)Justify the sparseness of the polynomial.
2)Use array structure and linked list separately.
3)Result polynomial has no Zero coefficients components and same power components
4)Two different output format: ASC, DESC according to the power.
Note: Write the full code in C++. Thanks for your help.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
