aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2025-02-27 18:35:13 -05:00
parent 8e4e15fa56
commit 72eb4943cb
1853 changed files with 35514 additions and 9441 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Task/Knapsack-problem-0-1/Crystal/knapsack-problem-0-1.cr
View file

@ -26,7 +26,7 @@ class Knapsack
candidate = items[candidate_index]
# candidate is a best of available items, so if we fill remaining value with it
# and still don't reach the threshold, the branch is wrong
return nil if taken.total_value + 1.0 * candidate.value / candidate.weight * remaining_weight < @threshold_value
return nil if taken.total_value + 1.0 * candidate.value / candidate.weight * remaining_weight <= @threshold_value
# now recursively check both variants
mask = taken.mask.clone
mask[candidate_index] = true