Greedy


  1. Fractional Knapsack

    Given list of N items where each item has some [weight, value] associated with it, put the items into a knapsack of capacity W to maximize the sum of values associated with the items Break items for maximizing total value is allowed.