CS 381 - Introduction to the Analysis of Algorithms
Techniques for analyzing the time and space requirements of
algorithms.
Application of these techniques to sorting,
searching,
pattern-matching,
graph problems, and
other selected problems.
Brief introduction to the intractable (NP-hard) problems.
