@andioop to Programming HorrorEnglish • edit-210 months agoGod I wish there was an easier way to do thisimagemessage-square55arrow-up1216arrow-down121
arrow-up1195arrow-down1imageGod I wish there was an easier way to do this@andioop to Programming HorrorEnglish • edit-210 months agomessage-square55
minus-squareMuchPineappleslinkfedilink8•edit-210 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]AlinkEnglish5•edit-210 months agooh shit yo this comment chain is pretty awesome, I learned a lot from this thanks!
minus-squarehuf [he/him]linkfedilinkEnglish4•10 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);