Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given a list of items with weights and values, find the maximum value you can carry in a knapsack of a fixed capacity using a Greedy algorithm.

Run the code to see the output here...