IMPROVE THE FOLOOWING ALGORITHM USING SYMMETRY OF BIONOMIALCOEFFICIENT::: Algori
ID: 3614420 • Letter: I
Question
IMPROVE THE FOLOOWING ALGORITHM USING SYMMETRY OF BIONOMIALCOEFFICIENT::: Algorithm 3.2: Binomial Coefficient Using DynamicProgrammingProblem: Compute the binomial Coefficient
Outputs: non-negegative integers n and k, Where k<=n
Output: Bin2. the binomial Coefficient (n k) Public static int bin2 (int n, int k)
{
index i,j;
int [] [] B = new int[0..n][0..k];
for (i = 0; i <= n; i++)
for (j=0;j <= minimum(i,j); j++)
if (j ==0 || j==1)
B[i][j] = 1;
else
B[i][j] = B[i - 1][j - 1] +B[i - 1][j];
return B[n][k];
}
IMPROVE THE FOLOOWING ALGORITHM USING SYMMETRY OF BIONOMIALCOEFFICIENT::: Algorithm 3.2: Binomial Coefficient Using DynamicProgramming
Problem: Compute the binomial Coefficient
Outputs: non-negegative integers n and k, Where k<=n
Output: Bin2. the binomial Coefficient (n k) Public static int bin2 (int n, int k)
{
index i,j;
int [] [] B = new int[0..n][0..k];
for (i = 0; i <= n; i++)
for (j=0;j <= minimum(i,j); j++)
if (j ==0 || j==1)
B[i][j] = 1;
else
B[i][j] = B[i - 1][j - 1] +B[i - 1][j];
return B[n][k];
}
Public static int bin2 (int n, int k)
{
index i,j;
int [] [] B = new int[0..n][0..k];
for (i = 0; i <= n; i++)
for (j=0;j <= minimum(i,j); j++)
if (j ==0 || j==1)
B[i][j] = 1;
else
B[i][j] = B[i - 1][j - 1] +B[i - 1][j];
return B[n][k];
}