根号数二分求解

#include<iostream>
#include<algorithm>
using namespace std;

double my_sqrt(double num) {
    double l = 0;
    double r = num > 1 ? num : 1;
    double eps = 1e-8;
    while (l <= r) {
        double mid = l + (r - l) / 2;
        if (mid * mid > num)
            r = mid - eps;
        else
            l = mid + eps;
    }
    return l;
}

int main()
{
    for (int i = 0; i < 10; ++i) {
        double num = i + 1e-4;
        cout << sqrt(num) << endl;
        cout << my_sqrt(num) << endl;
    }
    return 0;
}

0.01
0.01
1.00005
1.00005
1.41425
1.41425
1.73208
1.73208
2.00002
2.00003
2.23609
2.23609
2.44951
2.44951
2.64577
2.64577
2.82844
2.82844
3.00002
3.00002