Lecture 0: Course Overview Lecture 1: Analysis of Algorithms Lecture 2: Asymptotic Notations and Functions Lecture 3: Divide n Conquer Lecture 4: More on Divide and Conquer Lecture 5: Linear Time Sort Lecture 6: Elementary Data Structures Lecture 7: Binary Search Trees Lecture 8: Dynamic Programming Lecture 9: Greedy Algorithms Lecture 10: Elementary Graph Algorithms Lecture 11: Minimum Spanning Trees Lecture 12: Single Source Shortest Paths Lecture 13: All Pairs Shortest Paths Lecture 14: String Matching