CS 38100 - 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.
| Homepage | http://www.cs.purdue.edu/homes/seh/381webf08/ |
| Usually Offered: | Fall and Spring |
| Credit: | 3 hours (class) |
| Prerequisite: | MA 261 and CS 251 |
| University Catalog: | CS 381 |
