求平方根的两种方法

牛顿法

$$y-f(x_0)=f^{{}^{\prime }}(x)(x_1-x_0)$$
令 $y=0$ ，
$$x_1=x_0-\frac{f(x_0)}{f^{{}^{\prime }}(x_0)}$$
迭代下来，
$$x_{n+1}=x_n-\frac{f(x_n)}{f^{{}^{\prime }}(x_n)}$$
$$\begin{gathered} f(x)=x^2-n \\ {x}_{n+1}=x_n-\frac{x^2-n}{2x} \end{gathered}$$

double sqrt(double n){
    double epison = 0.00001;
    double last = 0.0;
    double res = 1.0;
    while(abs(res-last)>ep){
        last = res;
        res = res - (res*res-n)/(2*res);
    }
    return res;
}

二分法

二分法就是取left和right的中间数$\frac{left+right}{2}$，如果中间数的平方大于number，则在($left$，$\frac{left+right}{2}$)继续迭代二分法，如果中间数的平方小于number，则在($\frac{left+right}{2}$，$right$)继续迭代二分法，知道满足求得满足精度的结果

double sqrt1(double x){
    double EPSINON  = 0.00001;
    double low = 0.0;
    double high = x;
    double mid = (low+high)/2;
    while((high-low)>EPSINON){
        if((mid*mid)>x){
            high = mid;
        }
        else if(mid*mid<x){
            low = mid;
        }
        else{
            return mid;
        }
        mid = (low+high)/2;
    }
    return mid;
}