Wilfrid Laurier University Undergraduate Academic Calendar - 2011/2012
Canadian Excellence

Algorithm Design and Analysis I
0.5 Credit

Analysis of the best, average and worst-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.

Additional Course Information
CP213 (MA238 recommended).