数据结构第一章一些习题

horner规则

/*霍纳规则
 * 求多项式A(x) = a(n)*x^n+a(n-1)*x^(n-1)+......+a(0)
 *化为 A(x) = (...((a(n)*x+a(n-1))x+...+a(1))x+a(0))
 *20121206
 */
#include<stdio.h>
#define N 5
 
int main (void)
{
	double a[N] = {1,2,3,4,5},x = 3;
	double sum = a[N-1]*x+a[N-2];
	int i;
	for (i = 1;i < N;i++)
	{
		sum = sum * x + a[N-i-1];
	}
	printf("%f\n",sum);
	
	return 0;
}/*霍纳规则
 * 求多项式A(x) = a(n)*x^n+a(n