Greedy algorithm: Take as much of the most valuable item first. Does not necessarily give optimal value! Fractional Knapsack Problem. Consider the fractional ...
