4 ms·
"In the computer science terminology, an O(N) algorithm is considered “naive”, and in the computer security terminology, it even has a name - “brute force”" WT
by m0th87 16y ago
"In the computer science terminology, an O(N) algorithm is considered “naive”, and in the computer security terminology, it even has a name - “brute force”"
WTF?
- barrkel 16y agoI was trying to figure out if he was suggesting that adding machines ought to deliver a superlinear performance boost, which would be quite a trick. (Yes, there are sources of slight superlinear speedup in parallel scenarios, but nothing capable of beating n^2, never mind exponential growth.)
- katarn_ors 16y agoafter i read this, i decided i wouldn't be missing much if i just skimmed the rest