数据结构-9阶多项式

最新推荐文章于 2025-02-22 09:30:00 发布

weixin_33841722

最新推荐文章于 2025-02-22 09:30:00 发布

阅读量212

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/minTTremor/p/9090206.html

#include<stdio.h>
#include<time.h>
#include<math.h>
clock_t start, stop;
double duration;
#define MAXN 10 //多项式最大项数，即多项式阶数+1

double f1(int n, double a[], double x)
{
int i;
double p = a[0];
for (i = 1; i <= n; i++)
p += (a[i]*pow(x, i));
return p;

}

double f2(int n, double a[], double x)
{
int i;
double p = a[n];
for (i = n; i > 0; i++)
p = a[i - 1] + x*p;
return p;

}

int main()
{
int i;
double a[MAXN];
for (i = 0; i < MAXN; i++)
a[i] = (double)i;
start = clock();
f1(MAXN - 1, a, 1.1);
stop = clock();
duration = ((double)(stop - start)) / CLK_TCK;
printf("ticks1= %f\n", (double)(stop - start));
printf("duration1 = %6.2e\n", duration);

start = clock();
f1(MAXN - 1, a, 1.1);
stop = clock();
duration = ((double)(stop - start)) / CLK_TCK;
printf("ticks2= %f\n", (double)(stop - start));
printf("duration2 = %6.2e\n", duration);
getchar();
return 0;
}

转载于:https://www.cnblogs.com/minTTremor/p/9090206.html