@nave@lemmy.zip to Lemmy Shitpost@lemmy.worldEnglish • 2 years agoI wishi.imgur.comimagemessage-square169arrow-up1890
arrow-up1890imageI wishi.imgur.com@nave@lemmy.zip to Lemmy Shitpost@lemmy.worldEnglish • 2 years agomessage-square169
minus-square@mellejwz@lemmy.worldlinkfedilinkEnglish4•2 years agoNot neccessarily wrong, but you could also check the first bit. If it’s 1 the number is uneven, if it’s 0 the number is even. That seems to be more efficient.
minus-square@dukk@programming.devlinkfedilink4•2 years agoThat’s what I was thinking too… Although, I wouldn’t be surprised if most languages convert modulo 2 to this automatically.
minus-square@herrvogel@lemmy.worldlinkfedilink3•2 years agoModern compilers and interpreters are smart enough to figure out what you’re trying to do and automatically do that for you.
minus-square@ziviz@lemmy.sdf.orglinkfedilinkEnglish2•2 years agoHuh… That makes sense. Til. Ran some tests but speed is pretty similar. Only 4% faster using bitmath or 300 milliseconds difference after 10mil runs.
Not neccessarily wrong, but you could also check the first bit. If it’s 1 the number is uneven, if it’s 0 the number is even. That seems to be more efficient.
That’s what I was thinking too… Although, I wouldn’t be surprised if most languages convert modulo 2 to this automatically.
Modern compilers and interpreters are smart enough to figure out what you’re trying to do and automatically do that for you.
Huh… That makes sense. Til. Ran some tests but speed is pretty similar. Only 4% faster using bitmath or 300 milliseconds difference after 10mil runs.