Question: Write the fastest function to compute n factorial, where output should be within 1 to 2^63 n > 0, for n if its factorial is
Write the fastest function to compute n factorial, where output should be within 1 to 2^63 n > 0, for n if its factorial is bigger than 2^63 return -1 to indicate overflow or infinite.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
