Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
Finding n-th Fibonacci number in x86 assembler (gist.github.com)
17 points by przemoc on Dec 13, 2013 | hide | past | favorite | 6 comments


Love this bit: "Are black sheep among them actually gray?"


I don't understand why this is special. Anyone care to elaborate?


Indeed, it's nothing special. I just casually submitted it without any expectations. Sorry for disappointing you upon clicking the link.


Perhaps the title should mention that it's done in a mere 15 bytes of assembler:

"; size: ; 15 bytes"

So it's a code-golf sort of thing.


I found the comments to be the most interesting section of the page


I've been waiting for this all my life!




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: