int PolyEval(int coeff[], int n, const int& x)
{
int y=1;
int value=coeff[0];
for(int i=1; i<=n; i++)
{
y*=x;
value+=y*coeff[i];
}
return value;
}
// horner法则求多项式的值
//P(x)=(...(Cn*x+Cn-1)*x+Cn-2)*x+Cn-3)*x+...)*x+C0
int Horner(int coeff[], int n, const int& x)
{
int value=coeff[n];
for(int i=1; i<=n; i++)
value=value*x+coeff[n-i];
return value;
}
Ref: <<数据结构,算法与应用>>P37~38