Destide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 1 year agoInfallible Codelemmy.mlimagemessage-square160linkfedilinkarrow-up1494arrow-down127
arrow-up1467arrow-down1imageInfallible Codelemmy.mlDestide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 1 year agomessage-square160linkfedilink
minus-squareredxef@feddit.orgdeleted by creatorlinkfedilinkarrow-up38·1 year 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-up4·1 year 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·1 year agoHe loves me, he loves me not
minus-squarevandsjov@feddit.dklinkfedilinkarrow-up1·1 year 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.