this post was submitted on 07 Dec 2023
176 points (90.7% liked)

Programming Horror

2131 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 2 years ago
MODERATORS
 
all 47 comments
sorted by: hot top controversial new old
[–] Thyrian@ttrpg.network 58 points 2 years ago (3 children)

You could do this in one line...

By removing all the linebreaks.

[–] Strawberry@lemmy.blahaj.zone 2 points 2 years ago

i think it should one giant ternary expression composition

[–] iegod@lemm.ee 1 points 2 years ago

I love this thread 🫠

[–] olafurp@lemmy.world 45 points 2 years ago (1 children)

Of course there's an easier way. Just integrate the state of the art API dedicated for this exact problem. https://isevenapi.xyz/

[–] misophist@lemmy.world 36 points 2 years ago

This is confusing. I'm already using the iSeven API to determine if a number is 7. I'm getting a namespace collision error when I try to load this new API. Bug report filed.

[–] noddy@beehaw.org 22 points 2 years ago* (last edited 2 years ago) (1 children)

I know how to fix this!

bool IsEven(int number) {
    bool even = true;
    for (int i = 0; i < number; ++i) {
        if (even == true) {
            even = false;
        }
        else if (even == false) {
            even = true;
        }
        else {
            throw RuntimeException("Could not determine whether even is true or false.");
        }
    }

    if (even == true) {
        return even ? true : false;
    }
    else if (even == false) {
        return (!even) ? false : true;
    }
    else {
        throw RuntimeException("Could not determine whether even is true or false.");
    }
}
[–] odium@programming.dev 7 points 2 years ago (1 children)

Have you tried seeing if the recursive approach runs faster?

[–] noddy@beehaw.org 13 points 2 years ago

I know an even better way. We can make it run in O(1) by using a lookup table. We only need to store 2^64 booleans in an array first.

[–] Anticorp@lemmy.world 21 points 2 years ago (2 children)

Back when I was learning programming a lot of lessons would make you do something like this, and then show you the real way to do it in the next lesson. My reaction was always "why didn't you lead with this?".

You must see the pain before you confront it.

[–] Coreidan@lemmy.world 7 points 2 years ago

Because the point of the lesson is to demonstrate that you can solve the same problem multiple ways where some paths are more efficient than others.

Bad programmers are the ones that find the first solution and implement it no matter how inefficient it is.

Good programmers spend time on figuring out the solution with the least amount broken or inefficient code. You don’t learn this by jumping straight to the best answer every time.

[–] neidu@feddit.nl 20 points 2 years ago* (last edited 2 years ago) (1 children)

My solution in perl back in the day when I was a teenage hobbyist who didn't know about the modulus operator: Divide by 2 and use regex to check for a decimal point.

if ($num / 2 =~ /\./) { return "odd" }
else { return "even" }

[–] lysdexic@programming.dev 21 points 2 years ago (1 children)

Divide by 2 and check for a decimal point.

I mean, it ain't wrong.

[–] Chobbes@lemmy.world 4 points 2 years ago (2 children)

You know, I was going to let this slide under the notion that we're just ignoring the limited precision of floating point numbers... But then I thought about it and it's probably not right even if you were computing with real numbers! The decimal representation of real numbers isn't unique, so this could tell me that "2 = 1.9999..." is odd. Maybe your string coercion is guaranteed to return the finite decimal representation, but I think that would be undecidable.

[–] backgroundcow@lemmy.world 4 points 2 years ago (1 children)

Ackchyually-- IEEE 754 guarantees any integer with absolute value less than 2^24 to be exactly representable as a single precision float. So, the "divide by 2, check for decimals" should be safe as long as the origin of the number being checked is somewhat reasonable.

[–] Chobbes@lemmy.world 2 points 2 years ago

Of course, but it's somewhat nasty when all of a sudden is_even doesn't do what you expect :).

[–] lysdexic@programming.dev 1 points 2 years ago (1 children)

The decimal representation of real numbers isn’t unique, so this could tell me that “2 = 1.9999…” is odd.

I don't think your belief holds water. By definition an even number, once divided by 2, maps to an integer. In binary representations, this is equivalent to a right shift. You do not get a rounding error or decimal parts.

But this is nitpicking a tongue-in-cheek comment.

[–] Chobbes@lemmy.world 1 points 2 years ago

“1.99999…” is an integer, though! If you’re computing with arbitrary real numbers and serializing it to a string, how do you know to print “2” instead of “1.9999…”? This shouldn’t be decidable, naively if you have a program that prints “1.” and then repeatedly runs a step of an arbitrary Turing machine and then prints “9” if it did not terminate and stops printing otherwise, determining if the number being printed would be equal to 2 would solve the halting problem.

Arbitrary precision real numbers are not represented by finite binary integers. Also a right shift on a normal binary integer cannot tell you if the number is even. A right shift is only division by 2 on even numbers, otherwise it’s division by 2 rounded down to the nearest integer. But if you have a binary integer and you want to know if it’s even you can just check the least significant bit.

[–] SpeakinTelnet@programming.dev 13 points 2 years ago* (last edited 2 years ago) (2 children)
def is_even(n):
    match n:
        case 1:
            return False
        case 0:
            return True
        # fix No1
        case n < 0:
            return is_even(-1*n)
        case _:
            return is_even(n-2)
[–] sloppy_diffuser@sh.itjust.works 5 points 2 years ago (1 children)

Python added match/case?! Bunch of mypy issues have been closed too. Maybe its time to dust off some old projects.

[–] SpeakinTelnet@programming.dev 3 points 2 years ago

It was added in 3.10 and is surprisingly complete. The tutorial pep is a good starting point to see what it can accomplish

[–] Chobbes@lemmy.world 3 points 2 years ago

Well... At least it's tail recursive.

[–] recursive_recursion@programming.dev 8 points 2 years ago* (last edited 2 years ago) (5 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@programming.dev 19 points 2 years ago* (last edited 2 years 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 8 points 2 years ago (1 children)

here is somewhat less:

return (number % 2) == 0;

[–] pivot_root@lemmy.world 11 points 2 years ago (1 children)
[–] 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 & 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!

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

are the negative numbers all even?

[–] Vex_Detrause@lemmy.ca 4 points 2 years ago (1 children)
#You are an input. You have value! You matter!
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)

Am I doing it right? /S.

[–] PoolloverNathan@programming.dev 5 points 2 years ago

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

[–] misophist@lemmy.world 3 points 2 years ago

Name doesn't check out.

[–] RandomVideos@programming.dev 2 points 2 years ago

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

It should be:

if number % 2 == 0
  return "number is even" (is_num_even = 1 or true)
else
  return "number is not even" (is_num_even = 0 or false)
[–] Thyrian@ttrpg.network 5 points 2 years ago (1 children)

This could be optimized by using a recursive function.

[–] neeeeDanke@feddit.de 3 points 2 years ago

This could be made more servicavle by using a switch case

[–] vrighter@discuss.tchncs.de 5 points 2 years ago
[–] andioop@programming.dev 4 points 2 years ago
[–] tweeks@feddit.nl 3 points 2 years ago

I would love it if someone edited this example and posted it with two statements near the end that are reversed, implying inconsistent behaviour at random in the list ahead, seemingly making this solution less inefficient.

[–] AI_toothbrush@lemmy.zip 2 points 2 years ago

...btw a switch statement is better in this case(get it?)

[–] NostraDavid@programming.dev 1 points 2 years ago

You joke, but I've seen a programming language that didn't have a loop, and if you copied a line of text and pasted it in a text editor, JSON would come out...

The editor could barely handle 400+ lines because it probably converted the text to JSON, added a letter and converted it back to JSON... Per inserted symbol...

[–] aodhsishaj@lemmy.world 1 points 2 years ago (2 children)
[–] whyNotSquirrel@sh.itjust.works 6 points 2 years ago

print(theJoke % you);

wooosh

[–] dylanTheDeveloper@lemmy.world 3 points 2 years ago

I'm more of a Gemini myself