问题:
代码如下:
#include<stdio.h>
#include<math.h>
#include<time.h>
#define MAXK 1e7/* 重复运行次数*/
typedef double (*p)(int,double[],double);
clock_t start, stop;
double duration;
double f1(int n, double a[], double x);
double f2(int n, double a[], double x);
double calculateTime(p f, int n, double a[], double x);
int main()
{
double a[101];
int i;
//给a_n赋值
a[0] = 1;
for (i = 1; i <= 100;i++){
a[i] = (double)1/i;
}
calculateTime(f1,100,a,1.1);
calculateTime(f2,100,a,1.1);
}
//计算时间
double calculateTime(p f,int n, double a[], double x)
{
double result;
int i;
start = clock();/*开始计时*/
for (i = 0; i < MAXK;i++)
result = f(9, a, x);
stop = clock();/* 结束计时 */
duration = ((double)(stop - start)) / CLK_TCK/MAXK;/* 程序运行一次时间 */
printf("result is %lf, %2.3e seconds used\n",result,duration);
return result;
}
//普通算法
double f1(int n, double a[], double x)
{
double p=0;
int i;
for(i=0;i<=n;i++){
p+=pow(x,i)*a[i];
}
return p;
}
//秦九韶算法
double f2(int n, double a[], double x)
{
double p = a[n];
int i;
for(i=n-1;i>=0;i--){
p = x * p + a[i];
}
return p;
}
运行结果:
结论:
用秦九韶算法求多项式的值要比普通算法快近一个数量级。