bit.div.div_step¶
R[0] ^= N
if R[:n] >= D[:n]:
R -= D
not Q[0]
R,D are bit[:n], while R,N are bits.
Signature¶
def div_step n, N, D, R, Q @ do_sub, end { ... }
Defined in bit/div.fj — lines 134–141 (view on GitHub).
Complexity¶
Time:
n(10@+20)Space:
n(11@+22)
See the complexity glossary for what @, w, dw, dbit, n mean.