为什么这个BigInteger值会导致堆栈溢出异常？ C＃

Question

I am using BigInteger in C# in connection with the factorial function. The program has a lightning fast calculation of 5000!, but has an overflow error at 10000!. According to wolfram alpha , 10000! is approximately

10000! = 2.8 x 10^35659

From what I can tell from this post , a BigInteger is stored in an int[] array. If I interpret the int type correctly, it uses 4 bytes, meaning that 10000! uses about 4 x log10(2.8 x 10^35659) = 142636 bytes, where I use log10(n) (the log to base 10) as an approximation to the number of digits of n. This is only 143 MB, but I still get a stack overflow exception. Why does this happen?

using System;
using System.Numerics;

class Program
{
    static void Main()
    {
        BigInteger hugeFactorial = Calculations.Factorial(5000);
    }
}

class Calculations
{
    public static BigInteger Factorial(int n)
    {
        if (n == 1) return n;
        else return n*Factorial(n - 1);
    }
}

Answer 1

Default stack size for threads is 1 MB . You can change it while creating a new thread. I would write your code as(without blocking the calling thread):

TaskCompletionSource<BigInteger> tcs = new TaskCompletionSource<BigInteger>();
var t = new Thread(() => 
    {
        var res = Calculations.Factorial(10000);
        tcs.SetResult(res);
    }, 
    1024*1024*16 //16MB stack size
);
t.Start();
var result = await tcs.Task;
Console.Write(result);

Answer 2

As loopedcode said you should use at least iteration algorithm to calculate factorial.

public static BigInteger Factorial(int n)
{
    BigInteger result = 1;
    for (int i = 2; i <= n; i++)
    {
        result *= i;
    }
    return result;
}

There are even more efficient algorithms ( look here ).

Answer 3

Recursive call of Factorial results in stackoverflow for a large enough call stack. Your call for 10000! is likely hitting that mark. You will probably have to change your implementation to iterative algorithm to fix overflow.