Square Root Program for Small Computers
Original Publication Date: 1983-Apr-01
Included in the Prior Art Database: 2005-Feb-07
A square-root algorithm adapted for assembly or machine language runs efficiently on small computers. The root has a digital precision to the last possible bit; for example, the result of the square root of a 32-bit number has 16 significant bits. The algorithm also executes faster than many other algorithms. The algorithm extracts the square root of a number using iterative operations. It operates optimally on integers. Excusive-OR logic is employed in the rooting. The algorithm is readily adaptable to floating-point operations.