package Newton;

public class Polynomial extends Function{
double[] coefficients;

	public Polynomial(double[] c)
	{
		coefficients = new double[c.length];
		for (int i = 0; i<c.length; ++i)
			coefficients[i] = c[i];
	}
	
	public double evaluate(double x){
		double y = 0;
		double p = 1;
		for (int n = 0; n<coefficients.length; ++n)
		{
			y += coefficients[n] * p;
			p *= x;
		}
		return y;
	}
	
	public double derivative(double x){
		double y = 0;
		double p = 1;
		for (int n = 1; n<coefficients.length; ++n)
		{
			y += n* coefficients[n] * p;
			p *= x;
		}
		return y;
	}
	
	public void print(double value)
	{
		boolean first = true;
		for (int n = 0; n<coefficients.length; ++n)
		{
			if (coefficients[n] != 0){
				if (!first) System.out.print(" + ");
					System.out.print(coefficients[n] + " * (" + value + ")^" + n);
				first = false;
			}
		}
		
	}
}