Finding the integer square root of a number

Problem solving with programming: Finding the integer square root of a number
How do we implement a function to find the integer square root of a number?

For example int_sqrt(4) = 2, int_sqrt(10) = 3. (We have to take floor of the actual square root)
Binary search - bisection.

int sqrt(int x) 


{        


if( x == 0 )


return 0;




int low = 0;


int high = x;


long long mid = 0;




while( low <= high )


{


mid = low + (high-low)/2;


 


if( mid * mid <= x && (mid+1)*(mid+1) > x )


return mid;


else if( mid * mid > x)


high = mid-1;


else 


low = mid+1;


} 


return mid;


}

Also check http://massivealgorithms.blogspot.com/2014/07/babylonian-method-for-square-root.html
Read full article from Problem solving with programming: Finding the integer square root of a number