秦九韶算法：计算从1加到100000

#include <iostream>
#include <stdio.h>
#include <time.h>
using namespace std;

int main()
{
    clock_t start,finish;
    long x=1,a[100000],i,j,s=0,t;
    for(i=0;i<100000;i++)
        a[i]=i+1;
    start=clock();
    for(i=0;i<100000;i++){
        t=a[i];
        for(j=0;j<i;j++)
            t*=x;
        s+=t;
    }
    finish=clock();
    cout<<s<<endl;
    cout<<"普通算法的运行时间是"<<(long double)(finish-start)/CLOCKS_PER_SEC<<"秒"<<endl;
    s=a[99999],i=99999;
    start=clock();
    while(i>0)
    {
        t=s;
        s=t*x+a[--i];
    }
    finish=clock();
    cout<<s<<endl;
    cout<<"秦九韶算法的运行时间是"<<(long double)(finish-start)/CLOCKS_PER_SEC<<"秒"<<endl;
    return 0;
}