[Leetcode] Sqrt(x)

题目：Implement int sqrt(int x).

Compute and return the square root of x.

方法一：二分法

int sqrt_2part(int x)
{
	long int left=0;
	long int right=x;
	while(left<=right)
	{
		long int mid=left+(right-left)/2;
		unsigned long  square=mid*mid;
		if(square < x) 
			left=mid+1;
        else if(square > x) right = mid-1;  
        else return mid;
	}
	return (int)right;
}

方法二：数学上有更专业的牛顿迭代法

这里的方程是f(x)=x²-x0，f'(x)=2*x, 迭代方程是x'=x-f(x)/f'(x) =x0/(2*x)+x/2，代码如下

int sqrt_newton(int x) 
{
    if (x ==0)  
        return 0;  
    double pre;  
    double cur = 1;  
    do  
    {  
        pre = cur;  
        cur = x / (2 * pre) + pre / 2.0;        
    } while (abs(cur - pre) > 0.00001);  
    return int(cur);
}