In mathematics, the factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example,
0! is a special case that is explicitly defined to be 1.
When asked to write a program to compute factorial of a number, say n, we implement this definition into lines of code using a counter which iterates over the values from 1 to n and keep updating the result by multiplying the previous result with current value of counter. There is nothing wrong with this logic but the program fails to give correct results for 20! or higher. This is due to the limitations of the computing resources as the result becomes so large that it is not possible to store them in a 32-bit or 64-bit word.
Hence, to compute factorial of large numbers, we need to define our own logic.
Hint: Implement paper and pen method of multiplication without using Integer type variables.
Considering the limitations, we can use strings to store the numbers. The solution process breaks down as follows:
a) Since factorial involves multiplication, we need a function to multiply two numeric strings.
b) Since multiplication involves addition, we need a function to add two numeric strings.
So, first write down a logic to add two numbers, taking care of carry over from addition of previous digits present at respectively the same position in both numbers.
Then, write a utility function to pad 0’s to a number i.e. equivalent to multiplying it by a power of 10.
Using these functions, write the logic for multiplication of two numeric strings.
I coded the solution for this in Java. The code should work for any number. I tried it for 1000! , it took around 45-60 seconds to come up with the answer and it was correct as it matched the value given in this table at wikipedia. You can have a look at it and if you find any issues with it, please let me know.