Destide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 2 months agoInfallible Codelemmy.mlimagemessage-square156linkfedilinkarrow-up1491arrow-down125
arrow-up1466arrow-down1imageInfallible Codelemmy.mlDestide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 2 months agomessage-square156linkfedilink
minus-squareredxef@feddit.orglinkfedilinkarrow-up38·2 months 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 months 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.devlinkfedilinkarrow-up2·2 months agoHe loves me, he loves me not
minus-squarevandsjov@feddit.dklinkfedilinkarrow-up1·2 months 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.