Find more at https://solutionarium.notion.site/Bisection-method-a553dc3561154881bfb967f1c9224b57

bisection_method.cpp

#include <iostream>
#include <math.h>
using namespace std;

double f(double x){
    return log(x)-3; //use your function
}

double BisectionMethod(double Xl, double Xr, double epsilon){
    if (fabs(f(Xl)) < epsilon){
        return Xl;
    }
    else if (fabs(f(Xr)) < epsilon){
        return Xr;
    }
    else{
        if (f(Xr)*f(Xl) < 0){
            double Xm;
            do{
                Xm = (Xl + Xr)/2;
                if (f(Xm) == 0){
                    return Xm;
                }
                else if (f(Xl)*f(Xm) <= 0){
                    Xr = Xm;
                }
                else{
                    Xl = Xm;
                }
            } while (fabs(Xl - Xr) > epsilon);
            return Xm;
        }
        else{
            cout << "Не возможно найти корень на данном отрезке" << endl;
        }
    }
}

int main(){
    double X_left, X_right, eps = 0.0001;
    cout << "X_left = ";
    cin >> X_left;
    cout << "X_right = ";
    cin >> X_right;

    double result = BisectionMethod(X_left, X_right, eps);
    cout << "X = " << result;

    return 0;
}