andioop@programming.dev to Programming Horror@programming.devEnglish · edit-21 year agoGod I wish there was an easier way to do thisprogramming.devimagemessage-square55fedilinkarrow-up1209arrow-down120
arrow-up1189arrow-down1imageGod I wish there was an easier way to do thisprogramming.devandioop@programming.dev to Programming Horror@programming.devEnglish · edit-21 year agomessage-square55fedilink
minus-squareMuchPineapples@lemmy.worldlinkfedilinkarrow-up7·edit-21 year 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-up4·edit-21 year agooh shit yo this comment chain is pretty awesome, I learned a lot from this thanks!
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!