Binary Multiplication by "Long Multiplication"

Treat as a multi-line addition - such that a copy of the second multiplicand is placed in the sum corresponding to location of each 1 in the first multiplicand.

Try it the other way around:

Or step by step (click on image):

Question: What is the magnitude of the computational complexity of this algorithm?


Last updated 2000/09/26
© J.A.N. Lee, 2000.