© 1983 by British Computer Society
Short Notes
A Note on Computing the Square Root of an Integer

1 Rutherford and Appleton Laboratory, Chilton, Didcot, UK, 2 Department of Computing Science, University of Glasgow, Glasgow, UK
The method of successive subtraction for finding the square root of an integer or fixed-point number is particularly well-suited for implementation on a binary computer, and was in common use on first-generation machines. The method requires shifting but no division, and its execution time is dependent only on the precision required. A brief description of the method, a Pascal implementation, and some performance results are presented.
Received July 1982.
* Rutherford and Appleton Laboratory, Chilton, Didcot, Oxfordshire OX11 0QX, UK
Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK