GitHub - zwadhams/BinPackingProblem: My take on three solutions of the classic bin packing problem. Uses a Binary Search tree for two of the three functions. Runs of off the command line using two parameters. The first being the maximum bin size, and the second being a text file containing positive integers that are smaller than or equal to the max bin size. More info here: https://en.wikipedia.org/wiki/Bin_packing_problem

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
Bin.java		Bin.java
BinPacking.java		BinPacking.java
bintest.txt		bintest.txt

About

My take on three solutions of the classic bin packing problem. Uses a Binary Search tree for two of the three functions. Runs of off the command line using two parameters. The first being the maximum bin size, and the second being a text file containing positive integers that are smaller than or equal to the max bin size. More info here: https:/…