Theory

Division using shift

Use the assembly language (masm615)

Two numbers A (a_n a_n-1 ... a₂ a₁ a₀) and B (b_n b_n-1 ... b₂ b₁ b₀). The division of A/B yields a quotient Q (b_n q_n-1 ... q₂ q₁ q₀) and a remainder R that can be calculated by a series of shifts and subtractions.

Algorithm:(note: << represents logic shift to left)

Initialize i = n, Q = 0, Y = 0

Y = (Y << 1) + a_i

If Y >= B then: {Q = Q + 1, Y = Y - B}

i = i - 1

If i > 0 then goto 2

R = Y

Assignment

Your assignment will be to implement division suing shift instruction and conditional instructions and separately signed division.

Make sure your code works for 0's as arguments.