this post was submitted on 07 Dec 2023

195 points (91.1% liked)

Programming Horror

1891 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)

Credits

Icon base made by Lorc under CC BY 3.0 with modifications to add a gradient

founded 1 year ago

MODERATORS

Vacant

195

God I wish there was an easier way to do this (programming.dev)

submitted 11 months ago* (last edited 11 months ago) by andioop to c/programming_horror

55 comments fedilink hide all child comments

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

[–] recursive_recursion 9 points 11 months ago* (last edited 11 months ago) (7 children)

modulo

pseudocode:

if number % 2 == 0
  return "number is even" (is_num_even = 1 or true)
else
  return "number is odd" (is_num_even = 0 or false)

plus you'd want an input validation beforehand

[–] mac 23 points 11 months ago* (last edited 11 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 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 &amp; 0x1);

[–] recursive_recursion 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);

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

are the negative numbers all even?

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

Yes

[–] avonarret1 7 points 11 months ago

🤦

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

#You are an input. You have value! You matter!
if&nbsp;number&nbsp;%&nbsp;2&nbsp;==&nbsp;0
&nbsp;&nbsp;return&nbsp;"number&nbsp;is&nbsp;even"&nbsp;(is_num_even&nbsp;=&nbsp;1&nbsp;or&nbsp;true)
else
&nbsp;&nbsp;return&nbsp;"number&nbsp;is&nbsp;odd"&nbsp;(is_num_even&nbsp;=&nbsp;0&nbsp;or&nbsp;false)

Am I doing it right? /S.

[–] PoolloverNathan 5 points 11 months ago

Don't put nbsps in code blocks, they show up literally.

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

Name doesn't check out.

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

are u a wizard?

[–] RandomVideos 2 points 11 months ago

This code is terrible. If you input 10.66 it returns "number is odd

It should be:

if&nbsp;number&nbsp;%&nbsp;2&nbsp;==&nbsp;0
&nbsp;&nbsp;return&nbsp;"number&nbsp;is&nbsp;even"&nbsp;(is_num_even&nbsp;=&nbsp;1&nbsp;or&nbsp;true)
else
&nbsp;&nbsp;return&nbsp;"number&nbsp;is&nbsp;not even"&nbsp;(is_num_even&nbsp;=&nbsp;0&nbsp;or&nbsp;false)

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

John carmak posting