Differences
This shows you the differences between two versions of the page.
| courses:cs211:winter2012:journals:jeanpaul:chapterfour_section0 [2012/03/01 04:11] – created mugabej | courses:cs211:winter2012:journals:jeanpaul:chapterfour_section0 [2012/03/01 04:12] (current) – mugabej | ||
|---|---|---|---|
| Line 7: | Line 7: | ||
| Greedy algorithms are very useful as they arise in problems as varied as finding shortest path in a graph, network routing, interval scheduling, | Greedy algorithms are very useful as they arise in problems as varied as finding shortest path in a graph, network routing, interval scheduling, | ||
| \\ | \\ | ||
| - | This was just an introduction, | + | \\ |
| + | This was just an introduction, | ||
