191

submitted 9 months ago* (last edited 9 months ago) by [email protected] to c/[email protected]

56 comments fedilink hide all child comments

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

[-] [email protected] 21 points 9 months ago* (last edited 9 months 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

[-] [email protected] 8 points 9 months ago

here is somewhat less:

return (number % 2) == 0;

[-] [email protected] 9 points 9 months ago

return !(number & 1);

[-] [email protected] 8 points 9 months ago* (last edited 9 months ago)

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

return !(number &amp; 0x1);

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

[-] [email protected] 4 points 9 months ago

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

return !(n&1);

[-] [email protected] 2 points 9 months ago

are the negative numbers all even?

[-] [email protected] 2 points 9 months ago

Yes

this post was submitted on 07 Dec 2023

191 points (91.0% liked)

Programming Horror

1840 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

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 1 year ago

MODERATORS