Calculate the integer portion of the square root of a positive integer (j2s)

You cannot use floating point numbers in midp1.0.AlgorithmOnly the integer part of a positive integer can be calculated. There is no multiplication or division operation in the algorithm, and only addition or subtraction is required.

Algorithm principle:
1 + 3 + 5 +... + (2n-1) = n ^ 2
According to the formula we ask for the square of X, just let the X-1, X-3, X-5... Until X is negative, then all the successful times are the integer part of the square root.

/**
* @ Todo calculate the integer part of the square root of a positive integer
* @ Param X: a positive integer that requires the square root.
* @ Return integer part of the square root
**/
Private int SQRT (int x)
{
Int result = 0, j = 3;
X --;
While (x> = 0)
{
X-= J;
J + = 2;
Result ++;
}
Return result;
}