I am more amazed that he didn’t stop at 10 and think “damn this is tiresome isn’t there a one liner i could do?”. I want to know how far he went. His stubbornness is amazing but also scary. I haven’t seen this kind of code since back in school lol lol lol
Would this be a case of modulo saving the day?
Like: If Number modulo 2 = 0, true
This has to be taken out of context
This is why this code is good. Opens MS paint. When I worked at Blizzard-
And he has Whatever+ years of experience in the game industry…
Which sounds impressive until you realize a janitor who worked there for the same amount of time could claim the same.
Good if you are rated by an AI that pays for LOCs.
no unit tests huh.
/s
Thanks to goodness, finally. A (giggle & snort) solid algorithm. There ya’s go set yer clocks & go get a haircut.
this is like the making chess one
private?
This code would run a lot faster as a hash table look up.
In a Juliana tree, or a dictionary tree if you want. For speed.
I agree. Just need a table of even numbers. Oh and a table of odd numbers, of course, else you cant return the false… duh.
def is_even(n: int) -> bool: if n < 0: return is_even(-n) r = True for _ in range(n): r = not r return rHe loves me, he loves me not
No, no, I would convert the number to a string and just check the last char to see if it was even or not.
Y’all laugh but this man has amazing code coverage numbers.
This is YandereDev levels of bad.
this is yanderedev.
no the code is
Can you imagine being a TA and having to grade somebody’s hw and you get this first thing? lmao
Plot twist: they used a script to generate that code.
def even(n: int) -> bool: code = "" for i in range(0, n+1, 2): code += f"if {n} == {i}:\n out = True\n" j = i+1 code += f"if {n} == {j}:\n out = False\n" local_vars = {} exec(code, {}, local_vars) return local_vars["out"]scalable version
Not even else if? Damn, I guess we’re checking all the numbers every time then. This is what peak performance looks like
O(1) means worst and best case performance are the same.
