Question

5. (10 pts) Consider the problem to find a root of the equation fx) 0 within [xl, x2]. Assume that the function method eval) and f(x1)<0 and f(x2)>0. Complete the following binarySearch. method using recursion, which returns a solution Xe(x1, x2], satisfying If(刈< tol. fc) is implemented in the Class MyFunction [ public: virtual double eval (double x) ) double binarysearch (double x1, double x2, double tol) // assumption eval (x1) <0 and eval (x2)>0

Thank you for your helpful answer!(It's necessary for you to pay attention to the given information)

Answer 1

double binarySearch(double x1, double x2, double tol){

    double x = (x1+x2)/2;

    if (abs(eval(x))<tol){

        return x;

    }

    else{

        if(eval(x)<0){

            binarySearch(x, x2, tol);

        }

        else{

            binarySearch(x1,x,tol);

        }

    }

}