Mini-Challenge: Rudin-Shapiro Sequence

[Allen]

(12-16-2022 10:41 PM)John Keith Wrote:  

Code:


\<< { 1 } DUP ROT 2 SWAP   @ Do n-1 iterations
  START DUP2 + ROT ROT     @ Concatenate and move to top
    0 SWAP - +             @ Negate second part and concatenate
  NEXT +                   @ Concatenate last two lists
\>>

Some nice programming! I just noticed you can save 10% (5 bytes) of the program size by using the NEG function rather than "0 SWAP -"

(50 bytes)

Code:


\<< { 1 } DUP ROT 2 SWAP   @ Do n-1 iterations
  START DUP2 + ROT ROT     @ Concatenate and move to top
    NEG +                       @ NEG-ate second part and concatenate
  NEXT +                    @ Concatenate last two lists
\>>