Close Menu
View Course Sections

Course Description

Introduction to the study of algorithms. Strategies such as divide-and-conquer, greedy methods, and dynamic programming. Graph algorithms, sorting, searching, integer arithmetic, hashing, and NP-complete problems.  Recommendations: COMP 0015 Data Structures and COMP/MATH 0061 Discrete Mathematics (or similar courses).