The Knapsack Problem

by dynamic programming

The Fedex handling agent is in charge of loading a cargo aircraft bound for Europe. He has a collection of packages to that he can fit on the plane. However, the plane is only capable of holding a certain amount of cargo weight. By entering the number of packages, their corresponding weight, and the maximum cargo capacity of the airplane, this program will calculate which packages should be loaded on the flight.
# of Packages