Content deleted Content added
"Spelling. This is a semi-automatic update (software suggests changes and user decides). It is likely this bot did not fix all spelling mistakes in this article." |
mNo edit summary |
||
Line 3:
==History==
The algorithm was invented by [[Andrew D. Booth]] circa [[1957]] while doing research on [[crystallography]] at [[Birkbeck, University of London|Birkbeck College]] in [[Bloomsbury, London|Bloomsbury]], [[London]]. Booth invented this approach in a quest to find a fast way to multiply numbers with desk calculators as much of his early works involved a great deal of calculations with these devices. In machines of his era, [[shift]]ing was faster than addition, and indeed for some patterns of [[binary number]]s, his algorithm would be faster. Much surprisingly was the fact that the algorithm also worked for [[signed number]]s. Booth's algorithm remains to be an interest in the study of [[computer architecture]].
==Procedure==
| |||