C language code realizes dynamic programming 0-1 knapsack problem

You can refer to the following C language code to implement the dynamic programming 0-1 knapsack problem: int knapsack(int n, int w[], int v[], int W) { int i, j; int K[n+1][W +1];

for (i = 0; i <= n; i++) 
{ 
    for (j = 0; j <= W; j++) 
    { 
        if (i==0 || j==0) 
            K[i][j] = 0; 
        else if (w[i-1] <= j)