AlmightySnoo 🐢🇮🇱🇺🇦 to Programmer [email protected]English • 1 year agoLLMs Making Algorithms & Data Structures Obsoletelemmy.worldimagemessage-square15fedilinkarrow-up142arrow-down13
arrow-up139arrow-down1imageLLMs Making Algorithms & Data Structures Obsoletelemmy.worldAlmightySnoo 🐢🇮🇱🇺🇦 to Programmer [email protected]English • 1 year agomessage-square15fedilink
minus-square@[email protected]linkfedilinkEnglish13•1 year agoAny algorithm can be O(n^2) if you only want it to be occasionally right.
minus-square@[email protected]linkfedilinkEnglish12•1 year agoFunction isPrime(number): return false Accurate for almost 100% of cases
minus-squareJulianlinkfedilinkEnglish6•1 year agoAny algorithm can be O(1) if you cache all the answers beforehand.
minus-square@[email protected]linkfedilink2•10 months agoYes. 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.
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
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.