jing

来自「这是数据结构与算法描述一书中所有的源代码」· 代码 · 共 31 行

 #include "stdio.h"
  #include "math.h"
    double  root(a,b,eps,f)
    double  a,b,eps,(*f)();
    { double  f0,f1,c;
      f0=(*f)(a);
      while (fabs(a-b)>=eps)
        { c=(a+b)/2; f1=(*f)(c);
          if (f1==0)  return(c);
          if (f0*f1>0)  a=c;
          else  b=c;
        }
      c=(a+b)/2;
      return(c);
    }
 #include "root.c"
    main()
    { double a,b,eps,f();
      a=1; b=2; eps=0.000001;
      printf("x=%7.3f\n",root(a,b,eps,f));
    }

    double  f(x)
    double x;
    { double y;
      y=x+log(x)-2.2;
      return(y);
    }