Created
March 21, 2011 03:44
-
-
Save ianbishop/878981 to your computer and use it in GitHub Desktop.
napsack recurrence
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| if i = 0 or w = 0 | |
| m[i, w] = 0 | |
| if w[i] > w | |
| m[i - 1, w] | |
| if w[i] <= w | |
| max(m[i - 1, w], m[i - 1, w - w[i]] + v[i]) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment