CSCI 3104
Algorithms
Spring 1996
Class notes
Page 2
Previous page || Next page
Wednesday, January 17, 1996, continued
A case study: greedy algorithms
This is discussed in
Cormen et al,
Chapter 17, although
not with the exact same set of examples.
The examples we considered were ...
-
Making change of less than $1
-
Selection sort
-
The activity selection problem from Cormen et al
-
Formatting text into lines
-
Minimum cost spanning trees (see Cormen, in the chapter on
graph algorithms).
In all these cases, a solution can be built up by "greedy"
methods (although the solution in the text formatting
problem may not be optimal).
Previous page || Next page
Copyright © 1996
Karl Winklmann
Last edited (or copied to this place) at 11:15 AM, Friday, January 19, 1996.