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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!