⌘K
Contributed by Students
Super useful course, it can be hard to wrap your brain around some concepts, but just watch a lot of videos on it!
CP 312
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. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).