Subset sum problem: Difference between revisions
Content added Content deleted
| Line 749: | Line 749: | ||
done = 0 |
done = 0 |
||
# |
# |
||
proc subsum i w . . |
proc subsum i w k . . |
||
if done = 1 |
if done = 1 |
||
return |
return |
||
| Line 759: | Line 759: | ||
done = 1 |
done = 1 |
||
. |
. |
||
for j = k + 1 to n |
|||
if i <> 0 |
|||
k = set[i] + 1 |
|||
. |
|||
for j = k to n |
|||
set[i + 1] = j |
set[i + 1] = j |
||
subsum i + 1 w + w[j] |
subsum i + 1 w + w[j] j |
||
. |
. |
||
. |
. |
||
subsum 0 0 |
subsum 0 0 1 |
||
</syntaxhighlight> |
</syntaxhighlight> |
||
{{out}} |
{{out}} |
||