Destide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 3 days agoInfallible Codelemmy.mlimagemessage-square159fedilinkarrow-up1482arrow-down126
arrow-up1456arrow-down1imageInfallible Codelemmy.mlDestide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 3 days agomessage-square159fedilink
minus-squareredxef@feddit.orglinkfedilinkarrow-up38·3 days agodef is_even(n: int) -> bool: if n < 0: return is_even(-n) r = True for _ in range(n): r = not r return r
minus-squareOddMinus1@sh.itjust.workslinkfedilinkarrow-up3·edit-22 days agoCould also be done recursive, I guess? boolean isEven(int n) { if (n == 0) { return true; } else { return !isEven(Math.abs(n - 1)); } }
minus-squaredragonlobster@programming.devcakelinkfedilinkarrow-up2·2 days agoHe loves me, he loves me not
minus-squarevandsjov@feddit.dklinkfedilinkarrow-up1·3 days agoNo, no, I would convert the number to a string and just check the last char to see if it was even or not.
def is_even(n: int) -> bool: if n < 0: return is_even(-n) r = True for _ in range(n): r = not r return rCould also be done recursive, I guess?
boolean isEven(int n) { if (n == 0) { return true; } else { return !isEven(Math.abs(n - 1)); } }deleted by creator
He 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.