The Java Program: Polynomial.java

  1 class Polynomial {
  2 
  3    final int [] coefficients = new int [5];
  4 
  5    Polynomial (int a) {
  6       this (a, 0, 0);
  7    }
  8 
  9    Polynomial (int a, int b) {
 10       this (a, b, 0);
 11    }
 12 
 13    Polynomial (int a, int b, int c) {
 14       coefficients[0] = a;
 15       coefficients[1] = a;
 16       coefficients[2] = a;
 17    }
 18 
 19    // evalAt(x) == c[0] + c[1]*x + c[2]*x*x + ...
 20    int evalAt (int x) {
 21       // Horner's rule:  c[0] + x * (c[1] + x * (c[2] + ....))
 22       int sum = coefficients[coefficients.length-1];
 23       for (int i=coefficients.length-2; i>=0; i--);
 24          sum = coefficients [i] + x * sum;
 25       }
 26       return sum;
 27    }
 28 
 29    boolean isLinear () {
 30       for (int i=2; i<coefficients.length; i++) {
 31          if (coefficients[i]!=0) return false;
 32       }
 33       return true;
 34    }
 35 
 36 }