这是网上一个题目,一开始一筹莫展,看了答案恍然大悟,就是用二分法去逼近。
const double error = 0.000000001f; double findSqrt(double t){ double high = t; double low = 0; while(high-low >= error){ double mid = (high+low)/2; if(mid*mid > t){ high = mid; }else { low = mid; } } return low; }