this post was submitted on 07 Dec 2023
195 points (91.1% liked)

Programming Horror

1877 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 @[email protected]

Rules

Credits

founded 1 year ago
MODERATORS
[email protected]
195
God I wish there was an easier way to do this (programming.dev)
submitted 11 months ago* (last edited 11 months ago) by [email protected] to c/[email protected]
55 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 9 points 11 months ago (2 children)

here is somewhat less:

return (number % 2) == 0;

[–] [email protected] 10 points 11 months ago (1 children)

return !(number & 1);

[–] [email protected] 8 points 11 months ago* (last edited 11 months ago) (1 children)

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

return !(number & 0x1);
[–] [email protected] 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!

[–] [email protected] 4 points 11 months ago

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

return !(n&1);