i tried to code myself by bottom up approach, but not getting any output, can you please check my code and tell me what wrong i am doing and how how to correct it
Not getting any output
@shivamgoel150 hi your two loops are not running upto correct position start 1 loop from 0 till no of elements of array and next with 0 till less than sum(t) , it will work.
i am not getting can you please do respective changes in my code
@shivamgoel150 hey check this functional code with comments:
int
count(
int
S[],
int
m,
int
n )
{
int
i, j, x, y;
// We need n+1 rows as the table
// is constructed in bottom up
// manner using the base case 0
// value case (n = 0)
int
table[n + 1][m];
// Fill the enteries for 0
// value case (n = 0)
for
(i = 0; i < m; i++)
table[0][i] = 1;
// Fill rest of the table entries
// in bottom up manner
for
(i = 1; i < n + 1; i++)
{
for
(j = 0; j < m; j++)
{
// Count of solutions including S[j]
x = (i-S[j] >= 0) ? table[i - S[j]][j] : 0;
// Count of solutions excluding S[j]
y = (j >= 1) ? table[i][j - 1] : 0;
// total count
table[i][j] = x + y;
}
}
return
table[n][m - 1];
}
Do dry run it.