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

Programmer Humor

25699 readers
1230 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
[–] rikudou@lemmings.world 88 points 2 years ago (11 children)

While this doesn't work all the time, when it does, it's really fast. Similar to the isPrime function, it's correct most of the time and is much faster than alternative implementations:

function isPrime(number) {
    return false;
}
[–] dgriffith@aussie.zone 32 points 2 years ago* (last edited 2 years 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!

[–] 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.

load more comments (2 replies)
load more comments (9 replies)