COMP 221 - Algorithm Design and Analysis

An in-depth introduction to the design and analysis of algorithms. Topics may include algorithmic paradigms and structures, including recursion, divide and conquer, dynamic programming, greedy methods, branch and bound, randomized, probabilistic, and parallel algorithms, non-determinism and NP completeness. Applications to searching and sorting, graphs and optimization, geometric algorithms, and transforms. Prerequisite(s):

COMP 124

and

MATH 136

, or permission of instructor. Every fall. (4 Credits)