279
Returns a sorted list in O(1) time (programming.dev)
submitted 7 months ago by JPDev@programming.dev to c/programmer_humor@programming.dev
27 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[-] dgriffith@aussie.zone 36 points 7 months ago* (last edited 7 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!

[-] rikudou@lemmings.world 25 points 7 months ago

I mean, it has a 99.999%+ success rate on a large enough sample and I can live with that.

[-] dgriffith@aussie.zone 6 points 7 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.

[-] docAvid@midwest.social 5 points 7 months ago

Good idea, but it would be much faster if you do the double-check on true instead.

[-] xmunk@sh.itjust.works 1 points 7 months ago

This is a power(ful) idea.

Are my stats/programmers in the house?

[-] fibojoly@sh.itjust.works 4 points 7 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.

this post was submitted on 28 Jan 2024
279 points (95.4% liked)

Programmer Humor

19213 readers
295 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev