Re:Learn Big-O and stop hacking your way through algorithms
by xxpor on Thursday August 20, 2020 @06:41PM
(#24229867)
Sure, but that's not really the point. It's more running more code == probably bad for speed. There's obviously a lot of detail there, like time/space tradeoffs, large constants, etc.
[ Parent
| on HN ]
Re:Learn Big-O and stop hacking your way through algorithms
by lern_too_spel on Thursday August 20, 2020 @06:48PM
(#24229918)
I'm saying that an O(n!) algorithm is not necessarily faster asymptotically than an O(n) algorithm and that saying it is shows a fundamental misunderstanding of the definition. This is regardless of time/space tradeoffs and large constants.