280
Returns a sorted list in O(1) time (programming.dev)
submitted 5 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
[-] rikudou@lemmings.world 97 points 5 months ago

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;
}
[-] Asudox@lemmy.world 2 points 5 months ago

50/50 chance of being right in O(1) time

[-] andnekon@programming.dev 5 points 5 months ago

50/50 would be for isOdd with the same implementation

load more comments (2 replies)
load more comments (12 replies)
this post was submitted on 28 Jan 2024
280 points (95.5% liked)

Programmer Humor

18292 readers
325 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
Vacant@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev