Re:Calculating integer factorials in constant time, taking a...
by jmount on Tuesday December 15, 2015 @12:14PM
(#10738937)
Table lookup tended to be fast in the old days before the CPU and memory timings got so far out of whack. Now you need to double check that the calculation isn't in fact faster for the range you are interested in.
Re:Calculating integer factorials in constant time, taking a...
by noobermin on Tuesday December 15, 2015 @11:18AM
(#10738588)
What do you mean? They asked you to compute something but expected you to use a lookup table instead?
Re:Calculating integer factorials in constant time, taking a...
by WhitneyLand on Tuesday December 15, 2015 @03:49PM
(#10740368)
Yes, it was the only way to speed up an algorithm's implementation and they wanted to see if you could realize that.
When I wrote games for older hardware every frickin' thing possible used look up tables to maximize speed.
Coincidentally I received this type of problem later when interviewing at MS, but it wasn't Raymond Chen's group.