• Dave.@aussie.zone
    link
    fedilink
    arrow-up
    36
    ·
    edit-2
    9 months ago

    What your code can do is run this first and if it returns false then do a quick double check using a traditional isPrime function. Really speeds things up!

      • Dave.@aussie.zone
        link
        fedilink
        arrow-up
        6
        ·
        9 months ago

        Nah, you’ve always got to check the corner cases. It’s a variation on Murphy’s Law - you don’t encounter corner cases when you’re developing a program but corner cases are 99 percent of an everyday user’s interaction.

    • fibojoly@sh.itjust.works
      link
      fedilink
      arrow-up
      4
      ·
      9 months ago

      Better. Return true if the number is in a stored list of known primes, otherwise return false right away. But then, start a separate thread with an actual verification algorithm. When the verification is done, if it was actually a prime number, you just crash the program with a WasActuallyPrime exception.