cm0002@lemmy.world to Programmer Humor@programming.dev · 2 days agoInfallible Codefeddit.ukimagemessage-square54fedilinkarrow-up1275arrow-down118
arrow-up1257arrow-down1imageInfallible Codefeddit.ukcm0002@lemmy.world to Programmer Humor@programming.dev · 2 days agomessage-square54fedilink
minus-squarekolorafa@lemmy.worldlinkfedilinkarrow-up9·2 days agoBetter/fastest approch would be to check the last bit of the int and return the result. Second use modulo. This? Dev should burn in hell. Who created this?
minus-squarecows_are_underrated@feddit.orglinkfedilinkarrow-up9·2 days agoAlternatively you can divide by 2, turn it into an int, mtiply it by 2 and check if both numbers are the same.
minus-squareTheFogan@programming.devlinkfedilinkEnglisharrow-up4·edit-22 days agoor another stupid, but viable way to do it, if number = 0: return true runloop = true while runloop: if number > 0: number -= 2 else: number += 2 if number = 1: return false runloop = false if number = 2: return true runloop = false still very shitty amature coding, doesn’t depend on modulos, or anything that I can think of that some languages might lack an equivelant of.
minus-squarechuckleslord@lemmy.worldlinkfedilinkarrow-up5·2 days agoYandere Simulator Dev. Spaghetti code throughout
Better/fastest approch would be to check the last bit of the int and return the result. Second use modulo.
This? Dev should burn in hell. Who created this?
Alternatively you can divide by 2, turn it into an int, mtiply it by 2 and check if both numbers are the same.
or another stupid, but viable way to do it,
if number = 0:
return true
runloop = true
while runloop:
if number > 0:
number -= 2
else:
number += 2
if number = 1:
return false
runloop = false
if number = 2:
return true
runloop = false
still very shitty amature coding, doesn’t depend on modulos, or anything that I can think of that some languages might lack an equivelant of.
Yandere Simulator Dev. Spaghetti code throughout