Question: Consider the problem of computing N! = 1 2 3N. (a) If N is an n-bit number, how many bits long is N! in O()
Consider the problem of computing N! = 1 2 3N. (a) If N is an n-bit number, how many bits long is N! in O() notation (give the tightest bound)? (b) Give an algorithm to compute N! and analyze its running time.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
