C++浮点数二分法

#include <iostream>
using namespace std;

double bsearch(double x) {
    double l = 0, r = x;
    while(r - l > 1e-6) {
        int mid = (l + r) / 2;
        if(mid * mid >= x){
            r = mid;
        }else {
            l = mid;
        }
    }
}
int main()
{


    return 0;
}