CP312: Algorithm Design and Analysis I

Analysis of the best, average, and worse case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O (n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs.

3 lecture hours
Credit: 0.50
Prerequisite: CP264 (or CP114 and CP213) and MA238