190
submitted 11 months ago* (last edited 11 months ago) by andioop@programming.dev to c/programming_horror@programming.dev
you are viewing a single comment's thread
view the rest of the comments
[-] venoft@lemmy.world 8 points 11 months ago* (last edited 11 months ago)

This is the way. Modulo takes too long to compute, bitwise compare should be a lot faster.

return !(number & 0x1);
[-] recursive_recursion@programming.dev 5 points 11 months ago* (last edited 11 months ago)

oh shit yo

this comment chain is pretty awesome, I learned a lot from this thanks!

this post was submitted on 07 Dec 2023
190 points (90.9% liked)

Programming Horror

1634 readers
1 users here now

Welcome to Programming Horror!

This is a place to share strange or terrible code you come across.

For more general memes about programming there's also Programmer Humor.

Looking for mods. If youre interested in moderating the community feel free to dm @Ategon@programming.dev

Rules

Credits

founded 1 year ago
MODERATORS