Nathan Brunelle
Introduces the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divide-and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymtotic worst case, expected time, amortized analysis, and reductions between problems. Prerequisite: CS 2102 and 2150 with grades of C- or higher, and APMA 1090 or MATH 1210 or MATH 1310.
with Nathan Brunelle，教授课讲的很清楚，难度适中，作业量正常，每次课会发slides和课程录像。
Nathan Brunelle：教授挺chill的 有几次的hw挺难的但是可以找课友和office hour
with Nathan: 好老师，好课。反正学CS的都得上。