Algorithms

Catalog description

An overview of algorithm design and analysis. Topics include analysis of algorithms for traversing graphs and trees, searching and sorting, recursion, dynamic programming, and approximation, as well as the concepts of complexity, completeness, and computability. Students not able to register due to the restrictions may contact the department for permission.