thatguy2048 / knapsack / 0.1.0
This is an attempt to solve the knapsack problem by adding items with the highest value to weight ratio. To lessen the effects of adding items with high ratios but little actual value, the max weight is increased while adding, then items are removed in order of least value, until the weight requirement is met.

The expected input is a List<double[]>,double where the List<double[]> is a list of each item, each double[] is a separate item of a [weight,value] pair. The double is the maximum weight value of the sack. 

This does not check for negative weights or values, which may result in errors.