45
you are viewing a single comment's thread
view the rest of the comments
[-] duncesplayed@lemmy.one 12 points 1 year ago

Any algorithm can be O(n^2) if you only want it to be occasionally right.

[-] Iridium@lemmy.world 11 points 1 year ago
Function isPrime(number):
    return false

Accurate for almost 100% of cases

[-] darcy@sh.itjust.works 2 points 1 year ago

as test count approach infinity

[-] julianh@lemm.ee 4 points 1 year ago

Any algorithm can be O(1) if you cache all the answers beforehand.

[-] MajorHavoc@lemmy.world 2 points 1 year ago

Yes.

And depending how occasionally we're talking, I can code for some very fast solutions when the correctness requirements are low enough.

Alternately, if we want it to only be occasionally fast, I've got a very nice looking and very wrong algorithm for that, as well.

this post was submitted on 02 Jul 2023
45 points (94.1% liked)

Programmer Humor

32576 readers
492 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 5 years ago
MODERATORS