andioop@programming.dev to Programming Horror@programming.devEnglish · edit-21 year agoGod I wish there was an easier way to do thisprogramming.devimagemessage-square45fedilinkarrow-up188arrow-down110
arrow-up178arrow-down1imageGod I wish there was an easier way to do thisprogramming.devandioop@programming.dev to Programming Horror@programming.devEnglish · edit-21 year agomessage-square45fedilink
minus-squareodium@programming.devlinkfedilinkarrow-up3·1 year agoHave you tried seeing if the recursive approach runs faster?
minus-squarenoddy@beehaw.orglinkfedilinkarrow-up8·1 year agoI know an even better way. We can make it run in O(1) by using a lookup table. We only need to store 2^64 booleans in an array first.
Have you tried seeing if the recursive approach runs faster?
I know an even better way. We can make it run in O(1) by using a lookup table. We only need to store 2^64 booleans in an array first.