topdown_knapsack.txt

code for top down approach in knapsack

for(int i=1;i<=n+1;i++)
{
	for(int j=1;j<=w+1;j++)
{

	if(i==0 || j==0)
{
	t[i][j]=0;
}
	
	if(wt[i-1] <= j)
{
	t[i][j] = max(val[i-1] + t[i-1][j-wt[i=1]]),t[i][j]);
}

	else
{
	t[i][j] = t[i-1];
}

return t[n][w];