bit.cmp (arity 6)¶
TIme Complexity: n(2@+4)
jump to:
a[:n] < b[:n]: lt
a[:n] = b[:n]: eq
a[:n] > b[:n]: gt
a,b are bit[:n], lt,eq,gt are addresses.
Signature¶
def cmp n, a, b, lt, eq, gt { ... }
Defined in bit/cond_jumps.fj — lines 80–83 (view on GitHub).
Complexity¶
Space:
n(3@+6)
See the complexity glossary for what @, w, dw, dbit, n mean.