Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given a set of items, each with a weight and value, find the maximum value you can carry in a knapsack with a limited capacity using a Greedy algorithm.

Run the code to see the output here...