(33s) Implementation of NOT Function

[Gerald H]

Takes any number N from stack and returns NOT(N).
Any number of absolute value not zero returns zero,
zero returns one.
Preserves stack.

Can anyone find a more economical version while preserving the stack?

Code:

1.    LBL N
2.    STO H
3.    CLx
4.    1-ABS(SGN(H))
5.    RTN

N: LN = 28

[Gerald H]

YES!

But not good for small values, eg input of 0.00000001.

Code:

1.    LBL N
2.    COS
3.    IP
4.    RTN

N: LN = 12

But fastest is

Code:

1.    LBL N
2.    SGN
3.    ABS
4.    STO H
5.    CLx
6.    1
7.    RCL- H
8.    RTN

N: LN = 36

[Eddie W. Shore]

It's fascinating to see a trig function in one of the codes.