/*該程序功能:完成計(jì)算方法書67頁(yè)遞推梯形法的流程圖算法,針對(duì)67頁(yè)例3*/
                         #include "stdafx.h"
                            #include<iostream.h>
                                #include<math.h>
                                  #include<stdio.h>
double f(double x)
{
	return sin(x)/x;
}
int main(int argc, char* argv[])
{
	int n=1;
	double a,b,c,h,T1,x,T2,S,flag;
	   cout<<"Please enter 3 number:"<<endl;
	     cin>>a>>b>>c;  
	        h=b-a;
			  flag=0;
      T1=h*(1+f(b))/2;
	  
	do
	{
		if(flag)
		{
			h=h/2;
			  T1=T2;
		}
		flag=1;
		    S=0;
		      x=a+h/2;
		do{
			S+=f(x);
			     x+=h;
		}
		while(x<b);
		     T2=T1/2+h*S/2;
			 n=n*2;
	}
	 while(fabs(T2-T1)>=c);
	   cout<<"結(jié)果是:"<<endl;
	     cout<<"n="<<n<<endl;
		 printf("變步長(zhǎng)梯形法求積值為:%.7f\n",T2);
 	return 0;
}