You must log in or # to comment.
Impressive, very nice. Now let’s see LLM’s space complexity.
O(all the GPUs, all of them)Hey now, don’t forget all the memory too
And my cache!
Eggshell… and is that… Gothic type?
Any algorithm can be O(n^2) if you only want it to be occasionally right.
Function isPrime(number): return falseAccurate for almost 100% of cases
Any algorithm can be O(1) if you cache all the answers beforehand.
