x86 assembly language

Division using shift Two numbers A (an an-1 a2 a1 ao) and B (bn bn-1 b2 b1 bo). The division of A/B yields a quotient Q (bn qn-1 q2 q1 qo) and a remainder R that can be calculated by a series of shifts and subtractions. Algorithm:(note: represents logic shift to left) 1. Initialize i J n, Q 0, Y 0 a 3. If Y B then (Q- Q 1, 5. If i 0 then goto 2 6. R Y