Greedy-new-handouts-2

Greedy-new-handouts-2 - Merge Sort 2/20/2006 2:42 PM The...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Merge Sort 2/20/2006 2:42 PM 1 The Greedy Method 1 The Greedy Method The Greedy Method 2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Minimum Spanning Trees (§7.3) [future lecture]
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Merge Sort 2/20/2006 2:42 PM 2 The Greedy Method 3 The Greedy Method Technique The greedy method is a general algorithm design paradigm, built on the following elements: ± configurations : different choices, collections, or values to find ± objective function : a score assigned to configurations, which we want to either maximize or minimize It works best when applied to problems with the greedy-choice property: ± a globally-optimal solution can always be found by a series of local improvements from a starting configuration. The Greedy Method 4 Making Change Problem: A dollar amount to reach and a collection of coin amounts to use to get there. Configuration: A dollar amount yet to return to a customer plus the coins already returned Objective function: Minimize number of coins returned.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/10/2009 for the course CS 401 taught by Professor Cs401 during the Spring '08 term at Illinois Tech.

Page1 / 5

Greedy-new-handouts-2 - Merge Sort 2/20/2006 2:42 PM The...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online