Impressive, very nice. Now let’s see LLM’s space complexity.
O(all the GPUs, all of them)Eggshell… and is that… Gothic type?
Any algorithm can be O(n^2) if you only want it to be occasionally right.
Any algorithm can be O(1) if you cache all the answers beforehand.
Function isPrime(number): return falseAccurate for almost 100% of cases
as test count approach infinity
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.
isnt O(n³) usually simplified to O(n²) anyway ?
Yes. The other answer is technically correct, but yours is pragmatically correct.
If a solution is worse than O(nln(n))* then most of us are going to be looking for a pragmatic and completely alternate way to deal with it, rather than analyzing how to make it mildly less terrible.
So I’m just writing O(n^2) as a quick professional replacement for my original write in answer of “dogshit”.
