Линейные уравнения с++ - C++ - Ответ 16907902

#include <iostream>
#include <cmath>
#include <set>
 
double f(double x) {
    return pow(sin(x), 2) - x / 5 - 1;
}
 
double secant_method(double a, double b, double epsilon = 1e-6, int max_iterations = 100) {
    double x0 = a;
    double x1 = b;
    int iteration = 0;
 
    while (fabs(f(x1)) > epsilon && iteration < max_iterations) {
        double x_temp = x1 - (f(x1) * (x1 - x0)) / (f(x1) - f(x0));
        x0 = x1;
        x1 = x_temp;
        iteration++;
    }
 
    return x1;
}
 
struct RootCmp {
    static constexpr double epsilon = 1e-6;
    bool operator()(double l, double r) const { 
        return l+epsilon < r; 
    }
};
 
std::set<double,RootCmp> roots;
 
void solve(double a, double b)
{
    if (a>=b)
        return;
    double x=secant_method(a,b);
    if(roots.find(x)==roots.end()){
        roots.insert(x);
        solve(a,(x+a)/2);
        solve((x+b)/2,b);
    }    
}
 
int main() {
    solve(-4,0);
    for(auto x : roots){
        std::cout << "root = " << x << std::endl;
    }
    return 0;
}