CISC 320 Introduction to Algorithms (Fall 2005)

• Lecture 1 (Overview, optimality)
• Lecture 2 (Measuring algorithm performance, Big O)
• Lecture 3 (Recurrence & Master method)
• Lecture 4 (Quicksort and mergesort)
• Lecture 5 (Heapsort)
• Lecture 6 (Sorting in linear time)
• Lecture 7 (Selection and order statistics)
• Lecture 8 (Hash tables)
• Lecture 9 (Red-Black trees)
• Lecture 10 (Amortized analysis)
• Lecture 11 (Disjointed sets: Union-Find)
• Midterm study guide
• Lecture 12 (Graphs: Representations, BFS, DFS)
• Lecture 13 (Topological Sort and Strongly Connected Components)
• Lecture 14 (Minimum Spanning Trees: Prim Algorithm and Kruskal Algorithm)
• Lecture 15 (Single Source Shortest Paths: Dijkstra's algorithm; All Pairs Shortest Paths: Floyd-Warshall algorithm)
• Review for the final

Others

• CLRS's Webpage(http://theory.lcs.mit.edu/~clr/)
• Textbook Errata