Description: Polynomial calculations (one-way linked list application) design requirements: designed to handle n I. polynomial P (x) = a0+ a1x+ a2x2+ ...+ anxn, polynomials actually contains n+1 entries, the n+1 coefficients uniquely determined. To save storage space, storing only the coefficients of polynomials in non-0 entry. The use of the list in the store each node of a polynomial coefficient non 0, it contains three domains, namely the coefficient store, index and point to a pointer to the next node to its corresponding processing (x evaluated according to a polynomial, a number of the same polynomial processing, etc.).
To Search:
File list (Check if you may need any files):
include1.doc
Download