Description: Unary representation of sparse polynomials and operations. According to the structural characteristics of polynomial, linear linked list to achieve the polynomial are added storage nodes of the coefficient and index, constructed the corresponding polynomial. The list is initialized to empty, the polynomial order of each item into the list, and according to the list in ascending order polynomial. Polynomial addition, the first one into the list c of a polynomial, then the polynomial b, c each time you insert a list, the final results obtained polynomial c.
To Search:
File list (Check if you may need any files):
16008306.cpp
Download