Mohamed El-Feky elfekym
elfekym
/ knapsack.js
Created
March 12, 2018 08:32
— forked from danwoods/knapsack.js
Knapsack algorithm in JavaScript
This file contains 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
| //Knapsack algorithm | |
| //================== | |
| // wikipedia: [Knapsack (0/1)](http://en.wikipedia.org/wiki/Knapsack_problem#0.2F1_Knapsack_Problem) | |
| // Given a set `[{weight:Number, benefit:Number}]` and a capacity, | |
| // find the maximum value possible while keeping the weight below | |
| // or equal to the capacity | |
| // **params**: | |
| // `capacity` : Number, | |
| // `items` : [{w:Number, b:Number}] | |
| // **returns**: |