Revision as of 17:55, 26 October 2019 edit 2409:4063:231c:7cc8::14bd:58ac (talk) No edit summary Tags: Mobile edit Mobile web edit ← Previous edit		Revision as of 17:55, 26 October 2019 edit undo ClueBot NG (talk \| contribs) Bots, Pending changes reviewers, Rollbackers 6,478,121 edits m Reverting possible vandalism by 2409:4063:231C:7CC8:0:0:14BD:58AC to version by TAnthony. Report False Positive? Thanks, ClueBot NG. (3665508) (Bot) Tag: Rollback Next edit →
Line 1: '''Booth's multiplication algorithm''' is a [[multiplication algorithm]] that multiplies two signed [[base 2\|binary]] numbers in [[two's complement\|two's complement notation]]. The [[algorithm]] was invented by [[Andrew Donald Booth]] in 1950 while doing research on [[crystallography]] at [[Birkbeck, University of London\|Birkbeck College]] in [[Bloomsbury]], [[London]].<ref name="Booth_1951"/> Booth's algorithm is of interest in the study of [[computer architecture]].~~akash Mishra aman mishra Shubham riya I love you some too you janeman dilruba~~ ==The algorithm==

Booth's multiplication algorithm: Difference between revisions