Programming Horror

2147 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

Keep content in english
No advertisements (this includes both code in advertisements and advertisement in posts)
No generated code (a person has to have made it)

founded 2 years ago

MODERATORS

182

submitted 2 years ago* (last edited 2 years ago) by andioop@programming.dev to c/programming_horror@programming.dev

54 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] nullPointer@programming.dev 9 points 2 years ago (2 children)

here is somewhat less:

return (number % 2) == 0;

[–] pivot_root@lemmy.world 11 points 2 years ago (1 children)

return !(number & 1);

[–] venoft@lemmy.world 9 points 2 years ago* (last edited 2 years ago) (1 children)

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

return !(number &amp; 0x1);

[–] recursive_recursion@programming.dev 6 points 2 years ago* (last edited 2 years ago)

oh shit yo

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

[–] huf@hexbear.net 4 points 2 years ago

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

return !(n&1);