this post was submitted on 28 Jan 2024
262 points (95.5% liked)

Programmer Humor

25649 readers
2084 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 2 years ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
262
Returns a sorted list in O(1) time (programming.dev)
submitted 2 years ago by JPDev@programming.dev to c/programmer_humor@programming.dev
20 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] dgriffith@aussie.zone 32 points 2 years ago* (last edited 2 years ago) (2 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!

[–] rikudou@lemmings.world 24 points 2 years ago (1 children)

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

[–] dgriffith@aussie.zone 5 points 2 years 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 3 points 2 years ago

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