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.
[ Parent
| on HN ]
There are no comments on this comment yet.