101 Оverview
102 Sorting I
103 Sorting II
104 Searching & Data Structures
105 Red-Black Trees
106 Graph Algs. I - Topological Sorting, Prim′s Algorithm
107 Graph Algs. II - DFS, BFS, Kruskal′s Algorithm, Union Find Data Structure
108 Graph Algs. III - Shortest Path
109 Graph Algs. IV - Intro to geometric algorithms
110 Geometric Algs: Graham & Jarvis
111 Dynamic Programming I
112 Dynamic programming II
113 Parsing
114 Greedy Algs. I - Knapsack, Bandwidth Min. Intro:
115 Greedy Algs. II & Intro to NP Completeness
116 NP Completeness II & Reductions
117 NP Completeness III - More Reductions
118 NP Completeness IV
119 Approximation Algs.
120 Alternate Models of Computation