In the shift-and-add multiplication algorithm, what determines whether the multiplicand is added to the partial product during each iteration?

Question

Accepted Answer

The value of the current bit of the multiplier—if the bit is 1, add the multiplicand; if 0, skip the addition

Answer

Whether the multiplicand is larger than the current partial product

Answer

The value of the current bit of the multiplicand—if the bit is 1, add to the product

Answer

Whether the partial product is even or odd—add if even, skip if odd

Crowdly