196
submitted 1 year ago* (last edited 1 year 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
[-] nullPointer@programming.dev 9 points 1 year ago

here is somewhat less:

return (number % 2) == 0;

[-] pivot_root@lemmy.world 10 points 1 year ago
[-] venoft@lemmy.world 8 points 1 year ago* (last edited 1 year 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 1 year ago* (last edited 1 year ago)

oh shit yo

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

[-] huf@hexbear.net 4 points 1 year ago

just check the last bit jesus christ, what is it with these expensive modulo operations?!

return !(n&1);

this post was submitted on 07 Dec 2023
196 points (91.2% 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