/// <summary>
/// **秦九昭算法**
/// </summary>
/// <param name="n">n=多项式的项数</param>
/// <param name="a">a是存放多项式的数组,从最低位到最高位</param>
/// <param name="x">x 是变量的值</param>
/// <returns>返回多项式之和</returns>
Double QinJiuZhaoSuanFa(int n, double[] a, double x)
{
double p = 0;
for (int i = n; i > 0; i--)
{
p = a[i - 1] + x * p;
}
return p;
}