Course Notes - CS 263 - Analysis of Algorithms
The following documents provide supplemental notes for the course CS 263
Design and Analysis of Algorithms. These notes are not for general
distribution; they are for use only by students in CS 263.
Also, they are not complete. These are only supplements to the
discussions in class.
Notes by Topic
Introduction. Growth of functions.
Graph algorithms. Depth-first search. Breadth-first search.
Sorting and Selection.
The greedy method.
Michael T. Goodrich
Department of Computer Science
Donald Bren Hall 4216
University of California, Irvine, CA 92697-3435 USA