二分法解方程

《二分法解方程》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、#include#includeusingnamespacestd;doubleresult(doublex);//计算出代入X的值voidbinary(doublea,doubleb,doublec);//输出求出的值c代表误差值intmain(){cout<<"跟据闭区间的零点定理计算出一个区间：f(a)<0且f(b)>0"<>a>>b;cout<<"你选择的区间是从"<

2、ndl;cin>>c;binary(a,b,c);return0;}doubleresult(doublex){doubletemp;temp=f(x);//这个函数依情况而定计算出函数值returntemp;}voidbinary(doublea,doubleb,doublec){doubleaverage=(a+b)/2;while(sqrt(result(average)*result(average))>c){if(result(average)<0){a=average;b=b;}if(result(average

3、)>0){b=average;a=a;}average=(a+b)/2;}cout<<"最后的近似结果是:x="<#include#include#includeusingnamespacestd;typedefstructnode{intord;node*next;}Node;constintsize=512+1;Nodelist[size];intX[size];intY[size];boolvisit[s

4、ize];intsize_x;intsize_y;stackstk;voidinit(){inti;for(i=1;i<=size_x;i++)list[i].next=NULL;memset(X,0,(size_x+1)*sizeof(int));memset(Y,0,(size_y+1)*sizeof(int));}voidinput(intlen){inti;intx;inty;Node*p;for(i=0;iord=y;p

5、->next=list[x].next;list[x].next=p;}}booldfs(intx){Node*p;stk.push(x);for(p=list[x].next;p;p=p->next){if(!visit[p->ord]){visit[p->ord]=true;stk.push(p->ord);if(!Y[p->ord]

6、

7、dfs(Y[p->ord]))returntrue;elsestk.pop();}}stk.pop();returnfalse;}voidsolve(){inti;inttop;for(

8、i=1;i<=size_x;i++){while(!stk.empty())stk.pop();memset(visit,false,size_y+1);if(dfs(i)){while(!stk.empty()){top=stk.top();stk.pop();Y[top]=stk.top();X[stk.top()]=top;stk.pop();}}}}voidoutput(){inti;intcount=0;Node*p;for(i=1;i<=size_x;i++){if(X[i])count++;while(p=li

9、st[i].next){list[i].next=p->next;deletep;}}cout<#include#includevoidm

10、ain(){floata=1.0,b=1.5,c;//cin<