c语言实现的二分法,切割法,牛顿法求根算法
//二分法
double fun(double m,double n)
{
double r;int i=0;
if (quest(m)*quest(n)>0)
printf ("There are no roots in this area\n");
while (fabs(n-m)>esp)
{
r=(m+n)/2;
if (quest(r)*quest(n)<=0)
m=r;
else