Question: function multiply(x,y) Input: Two n-bit integers x and y, where y 0 Output: Their product if y = 0: return 0 z = multiply(x,by/2c) if
function multiply(x,y)
Input: Two n-bit integers x and y, where y 0
Output: Their product if y = 0: return 0
z = multiply(x,by/2c)
if y is even:
return 2z
else: return x + 2z
How long does the recursive multiplication algorithm take to multiply an n-bit number by an m-bit number? Justify your answer.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
