Classroom Slides

• Slide Set 1: The BIG Picture
• Slide Set 2: Dimensions of Algorithm Design
• Slide Set 3: Algorithm Analysis part I
• Slide Set 4: Algorithm Analysis part II
• Slide Set 5: Data Structures part I
• Slide Set 6: Data Structures part II
• Slide Set 7: Data Structures part III
• Slide Set 8: X-treme Sorting!
• Guest lecture, Dave Saunders on Huffman codes and closest pair of points
• Slide Set 9: X-treme Sorting! p2
• Slide Set 10: X-treme Sorting! p3
• Slide Set 11: Introducing graphs
• Slide Set 12: BFS
• Slide Set 13: Lo-Graphics DFS
• Slide Set 14: Finish Chapter 5
• Slide Set 15: Weighted Graphs
• Guest Lecture, Dave Saunders
• Slide Set 17: Dijkstra, All pairs, and misc.
• Slide Set 18: Closure, Matchings, Flows
• Slide Set 19: Graph wrap-up
• Slide Set 20: Hard Problem warm-up
• Slide Set 21: Fuzzy heuristic alchemy
• Saunders Guest Lecture on Dynamic Programming
• Slide Set 23: Proving Hardness
• Slide Set 24: Reduction Redux
• Slide Set 25: Final Class