You're viewing a single thread.
All Comments
15 comments
Any algorithm can be O(n^2) if you only want it to be occasionally right.
17 0 ReplyFunction isPrime(number): return false
Accurate for almost 100% of cases
18 0 Replyas test count approach infinity
2 0 Reply
Any algorithm can be O(1) if you cache all the answers beforehand.
5 0 ReplyYes.
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.
2 0 Reply
15 comments
Scroll to top