Anonymous user
Knapsack problem/Bounded: Difference between revisions
→{{header|C#}}
Line 565:
static string knapSack(uint w1)
{
init(); change();
uint n = (uint)w.Length; var K = new uint[n + 1, w1 + 1];
for (uint vi, wi, w0, x, i = 0; i < n; i++)
|