Programmer Humor

18971 readers

1468 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

Keep content in english
No advertisements
Posts must be related to programming or programmer topics

founded 1 year ago

MODERATORS

[email protected]

280

Returns a sorted list in O(1) time (programming.dev)

submitted 6 months ago by [email protected] to c/[email protected]

27 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 36 points 6 months ago* (last edited 6 months ago) (3 children)

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!

[–] [email protected] 25 points 6 months ago (1 children)

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

[–] [email protected] 6 points 6 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.

[–] [email protected] 5 points 6 months ago (1 children)

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

[–] [email protected] 1 points 6 months ago

This is a power(ful) idea.

Are my stats/programmers in the house?

[–] [email protected] 4 points 6 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.