Auuuuu 😢

Oh MY GOD !

return x%2 == 0

x&1

@henlo That works? Man... I should learn about binary operations

def is_even(x):
return not is_odd(x)

def is_odd(x):
return not_is_even(x)

@lazyDev u want so see the word burn huh?

@Marl3x c++ bit wise shit. This expression is true if x is odd

My eyes hurt D:

MY EYES, MY EYES !!

is_even(MAX_INT) // discard return value because idc

Wtf? 😂

Hurray co-recursion?

error message received when
x > 498:

RecursionError: maximum recursion depth exceeded in comparison

I'm actually somewhat surprised at how fast this is, despite how absolutely terrible it is. The default python recursion depth limit is triggered after x=498 so these functions are kinda useless... unless you know for sure no one would ever try a number larger than 498.

😲

@corscheid its useless anyway because you can literally do %2

@Supersebi3
`(x&1)==0` is still the fastest. No division, only a single AND and CMP.

Though it's python so it's all interpreted anyway; who knows what instructions the code actually maps to. I really kind of hate interpreted languages because of this.

@Root doesnt really matter for my point but ok

@Supersebi3 If you're going to do something, do it well. 😋

wot in tarnation

That is a nice (useless) demo to show recursion, although is_even wouldn't need to call is_odd.

However, if all calls would be using constants, a C++ recursive template would be fastest:
The compiler would do the math, and would substitute all calls with the results.
That's called TMP.
C++ rocks! 😁