Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
inoop
on May 11, 2012
|
parent
|
context
|
favorite
| on:
Infinite complexity in 4096 bytes
mov ax, 13h int 10h
exDM69
on May 11, 2012
[–]
You are correct. And using a mov to ax rather than xor+mov to al is counter-intuitively one byte smaller (there's one more byte of immediate value in the former). Every byte counts!
(I tested using "nasm -f bin")
gliptic
on May 11, 2012
|
parent
[–]
However, in .coms you could assume that AX was 0 upon entry and skip the XOR.
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
