On a fast integer square root algorithm

Abstract

The long-hand square root algorithm, when implemented in binary arithmetic, produces immediately the analytic result (as opposed to the successive approximations generated by the Newton-Raphson method). It also uses only addition, subtraction, and bits shifts; it is related to the binary integer division algorithm, but is in fact a simpler procedure.