Lecture Slides

Each of the eight topics will span several lectures.  The PowerPoint slides for the current topic will be updated after every lecture.  Once a topic has been completed then the slides for that topic will be complete.

First Class Introduction

Part 1: Complexity

Part 2: Lists

Part 3: Sorting

Part 4: Search Trees

Part 5: Hash Tables

Part 6: Heaps

Part 7: Union/Find

Part 8: Graphs

Part 9: NP-Completeness

Part 10: K-dimensional Search Trees & Randomized Algorithms