198
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
[-] mac@programming.dev 18 points 1 year ago* (last edited 1 year ago)

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 8 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!

[-] perviouslyiner@lemm.ee 2 points 1 year ago

are the negative numbers all even?

this post was submitted on 07 Dec 2023
198 points (100.0% liked)

Programming Horror

1891 readers
2 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 2 years ago
MODERATORS