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!
Zima I the rudest person I've met in this entire university, his favourite hobby is to humiliate anyone who dares asking him questions. I don't understand how a "serious" university can have someone like this teaching. The logic of algorithms and problem solving is extremely important, but this course is much more of math proofs course than algorithmic thinking.
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).