Sections

Sections are located in room 380-381U, on Tuesdays 4:30-5:20 pm, and are led by Michael Chen.
During Section, we will go over the material covered in class that week, and work through practice problems.
Sections are completely optional.
Sections are for you! Section time is your time, so if you have anything specific you would like us to cover in section, or any feedback about the format, please let us know in the anonymous feedback form or by emailing Michael directly (mvchen at stanford).

Section 1 (10/3): Asymptotic analysis, recurrence relations, divide and conquer. [Problems] [Solutions]
Section 2 (10/10): Randomized algorithms, selection. [Problems] [Solutions]
Section 3 (10/17): Binary Trees: Rotation and Construction. [Problems] [Solutions]
Section 4 (10/24): Midterm review. [Problems] [Solutions]
Section 5 (10/31): Search, Strongly Connected Components. [Problems] [Solutions]
Section 6 (11/7): Bellman–Ford, Dijkstra. [Problems] [Solutions]
Section 7 (11/14): Dynamic Programming. [Problems] [Solutions]
Section 8 (11/28): Greedy Algorithms. [Problems] [Solutions]
Section 9 (12/5): Max Flow. [Problems] [Solutions]