Collatz Conjecture in Assembly shortest form
问题 We had an assignment where we had to write the collatz conjecture in 64bit nasm assembly with only 13 commands or less (RET included). Now we are wondering how much you can actually reduce it. We are currently on 9. Heres the collatz conjecture in pseudo code for reference: Heres the code we have so far. A few notes: A tutor of us said we can remove the XOR rax, rax because of some calling convention it's already zero. It doesn't work on my computer though so I've included it here. I'm aware