Leetcode No69. SQRT (x)

Question:

Implement int sqrt(int x) .

Compute and return the square root of X.

Find square root

algorithm:Newton iterative method, after iterating multiple times, can find the square root. There is also a 3 program code for the Thor Hammer, which is faster than the C + + standard library sqrt (). posted here Link:http://blog.csdn.net/wangxiaojun911/article/details/18203333, if there is a great God to understand also trouble teach small white. Accepted Code:

Class Solution {  //Newton Iteration algorithm public:    int mysqrt (int x) {        if (x<2) return x;        int left = 0;        int right = x;        while (Left<right)        {Right           = (left+right)/2;           left = X/right;        }        return min (left,right);    };

Leetcode No69. SQRT (x)