COMP 3330 - Analysis of Algorithms

Credit Hours: 3
This course covers complexity of algorithms and algorithm design techniques. Topics include analysis of algorithm correctness, analysis of algorithm efficiency using asymptotic notations, algorithm design techniques including brute-force, divide-and-conquer, greedy, and dynamic programming approaches.

Prerequisite(s): COMP 2270 and MATH 2562