Consider the problem of computing N! = 1∙2∙3…N.
(a) If N is an n-bit number, how many bits long is N!, approximately (in Θ(∙) form)?
(b) Give an algorithm to compute N! and analyze its running time.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.