Re:Calculating integer factorials in constant time, taking a...
by Dylan16807 on Tuesday December 15, 2015 @06:22PM
(#10741222)
The definition talks about what happens for extremely large numbers.
It does not talk about smaller numbers at all.
If you use an algorithm and complexity that are close for both moderately large numbers and extremely large numbers, you've done a good job.
If you introduce dumb things like constants that are larger than the known universe, you are performing obfuscation.
The suggested algorithm is linear, but only when applied to a very specific interpretation of the problem. I'm disagreeing with that interpretation of the problem, not the conclusion that it's linear within that particular interpretation.
It does not talk about smaller numbers at all.
If you use an algorithm and complexity that are close for both moderately large numbers and extremely large numbers, you've done a good job.
If you introduce dumb things like constants that are larger than the known universe, you are performing obfuscation.
The suggested algorithm is linear, but only when applied to a very specific interpretation of the problem. I'm disagreeing with that interpretation of the problem, not the conclusion that it's linear within that particular interpretation.