CS 331 - Design and Analysis of Algorithms (4)

Algorithm design techniques including divide-and-conquer, the greedy method, dynamic programming, backtracking, and branch-and-bound. Analysis of sorting and searching. Tractability. Complexity analysis using basic asymptotic notation.

Prerequisite(s): CS 241 and MAT 208 with grades of C or better, or consent of instructor.