62
LLMs Making Algorithms & Data Structures Obsolete
(lemmy.world)
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 02 Jul 2023
62 points (93.1% liked)
Programmer Humor
32211 readers
191 users here now
Post funny things about programming here! (Or just rant about your favourite programming language.)
Rules:
- Posts must be relevant to programming, programmers, or computer science.
- No NSFW content.
- Jokes must be in good taste. No hate speech, bigotry, etc.
founded 5 years ago
MODERATORS
Any algorithm can be O(n^2) if you only want it to be occasionally right.
Accurate for almost 100% of cases
as test count approach infinity
Any algorithm can be O(1) if you cache all the answers beforehand.
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.