二分法拓展—计算根号2近似值

#include<iostream>
const double eps = 1e-5;
double f(double x)
{
	return x * x;
}
double calSqrt()
{
	double left = 1, right = 2, mid;
	while(right - left > eps)
	{
		mid = (left + right) / 2;
		if(f(mid) > 2) right = mid;
		else left = mid;
	}
	return mid;
}
int main()
{
    printf("%.4f", calSqrt());
	return 0;
}