This took me a while to figure out: All permutations of a naturally ordered string. In Python/Rust I’d use recursion, but on an 8-Bit you run out of space on the stack pretty quickly. Managed to come up with a working iterative version. Now I’ll redo it in Assembly ;-) #commodore

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: