Greedy algorithms.md (463B)
1 +++ 2 title = "Greedy algorithms" 3 +++ 4 5 # Greedy algorithms 6 7 Greedy: take locally optimal solution (which is often globally optimal, but not always) 8 9 Make change: 10 11 - Problem: coins with certain values, have to get to a given amount 12 - Solution: take as many as possible, starting at the highest values and decreasing until value is reached 13 14 [Activity selection](../activity-selection) 15 16 [Fractional knapsack](../fractional-knapsack) 17 18 [Huffman codes](../huffman-codes)