Algorithm for Calculating Binomial Coefficient
algorithm, c#, combinatorics, math
Solution
public static long combination(long n, long k)
{
double sum=0;
for(long i=0;i<k;i++)
{
sum+=Math.log10(n-i);
sum-=Math.log10(i+1);
}
return (long)Math.pow(10, sum);
}
Problem
I need a way of calculating combinations without running out of memory. Here's what i have so far. ``` public static long combination(long n, long k) // nCk { return (divideFactorials(factorial(n), ((factorial(k) * factorial((n - k)))))); } public static long factorial(long n) { long result; if (n <= 1) return 1; result = factorial(n - 1) * n; return result; } public static long divideFactorials(long numerator, long denominator) { return factorial(Math.Abs((numerator - denominator))); } ``` I have tagged it as C#, but the solution should ideally be language independent.