Destide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 1 year agoInfallible Codelemmy.mlimagemessage-square153linkfedilinkarrow-up1485
arrow-up1485imageInfallible Codelemmy.mlDestide@feddit.uk to Programmer Humor@lemmy.mlEnglish · 1 year agomessage-square153linkfedilink
minus-squareredxef@feddit.orgdeleted by creatorlinkfedilinkarrow-up37·edit-25 months agodeleted by creator
minus-squareOddMinus1@sh.itjust.workslinkfedilinkarrow-up3·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.
deleted by creator
Could 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.