is represented by pairs of corresponding exponents and
coefficients for each term of the
polynomial, i.e., all coefficients in this
representation are nonzero
in this representation, the polynomial
would be represented by the list ( (1000 2) (0 -1) )
the time complexity of the algorithm for adding two polynomials
with terms is
to increase the effectiveness of algorithms using this sparse
representation, a rule is usually applied which specifies the
order of pairs in the list based on the exponents, e.g., in the
example above, the lists are sorted in descending order of
exponents
for each term of the
polynomial, i.e., all coefficients 
in this
representation are nonzero
terms is 