It uses Gauss Lemma to get the potential roots of an integer coefficients polynomial. Then it does Ruffini's rule for each potential root and determine if each value is a root. If a root is found the ...

Write code to find the roots of arbitrary polynomials. The coefficients of the polynomial should be stored in an List (Java or Python), or an Integer array (C). The coefficients should be user ...