this post was submitted on 07 Dec 2023
178 points (90.8% liked)

Programming Horror

1833 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
Vacant@programming.dev
178
God I wish there was an easier way to do this (programming.dev)
submitted 9 months ago* (last edited 9 months 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
[–] mac@programming.dev 23 points 9 months ago* (last edited 9 months ago) (2 children)

who needs modulo when you can get less characters out of

while (number > 1) {
  number -= 2;
}
return number;

very efficient

edit: or theres the trusty iseven api

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

here is somewhat less:

return (number % 2) == 0;

[–] pivot_root@lemmy.world 10 points 9 months ago (1 children)

return !(number & 1);

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

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 9 months ago* (last edited 9 months ago)

oh shit yo

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

[–] huf@hexbear.net 4 points 9 months ago

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

return !(n&1);

[–] perviouslyiner@lemm.ee 2 points 9 months ago (1 children)

are the negative numbers all even?