typedef struct {char a[9];} t; t b(uint8_t x) { t s; for (int i=8; i>0; x>>=1) s.a[--i]=48+(x&1); s.a[8]=0; return s; }
-
if only I had a superoptimizer ...
@spun_off I guess the superoptimized version of this would be a lookup table with 256 entries.
-
-
This suboptimized version is much more fun to think through:https://twitter.com/oe1cxw/status/801418398546690049 …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.