andioop@programming.dev to Programming Horror@programming.devEnglish · edit-211 months agoGod I wish there was an easier way to do thisprogramming.devimagemessage-square55fedilinkarrow-up1212arrow-down120
arrow-up1192arrow-down1imageGod I wish there was an easier way to do thisprogramming.devandioop@programming.dev to Programming Horror@programming.devEnglish · edit-211 months agomessage-square55fedilink
minus-squareNullPointer@programming.devlinkfedilinkarrow-up9·11 months agohere is somewhat less: return (number % 2) == 0;
minus-squareMuchPineapples@lemmy.worldlinkfedilinkarrow-up8·edit-211 months agoThis is the way. Modulo takes too long to compute, bitwise compare should be a lot faster. return !(number & 0x1);
minus-squarerecursive_recursion [they/them]@programming.devlinkfedilinkEnglisharrow-up5·edit-211 months agooh shit yo this comment chain is pretty awesome, I learned a lot from this thanks!
minus-squarehuf [he/him]@hexbear.netlinkfedilinkEnglisharrow-up4·11 months agojust check the last bit jesus christ, what is it with these expensive modulo operations?! return !(n&1);
here is somewhat less:
return (number % 2) == 0;return !(number & 1);This is the way. Modulo takes too long to compute, bitwise compare should be a lot faster.
return !(number & 0x1);oh shit yo
this comment chain is pretty awesome, I learned a lot from this thanks!
just check the last bit jesus christ, what is it with these expensive modulo operations?!
return !(n&1);