Information

• Syllabus
• Course Information
• A list of known bugs for the textbook.

Homework

• Homework 1
• Homework 2
• Homework 3
• Homework 4
• Homework 5
• Homework 6
• Homework 7

Homework Solutions

• Homework 1
• Homework 2
• Homework 3
• Homework 4
• Homework 5
• Homework 6
• Homework 7

Notes

• Strassen's Algorithm
• Lecture 1 Notes
• Some math facts
• Running times of various functions
• Lecture 2 Notes
• Lecture 3 Notes
• Heapsort loop invariant
• Radix and Counting Sort
• Picture of card sorter
• Lecture 5 Notes
• Deterministic Selection
• Lecture 6 Notes
• Random Permutation Loop Invariant
• Lecture 7 Notes
• Quicksort
• Randomized Selection
• Lecture 8 Notes
• Skip Lists
• Lecture 9 Notes
• Dynamic Programming
• Program to make change
• Lecture 10 Notes
• Dynamic Programming (2)
• Fibonacci numbers program
• Longest Common Subsequence
• Lecture 12 Notes
• Greedy Algorithms
• Lecture 13 Notes
• Huffman Coding
• Lecture 14 Notes
• Amortized Analysis
• Lecture 15 Notes
• Disjoint Sets
• Lecture 16 Notes
• Graph Algorithms
• Lecture 17 Notes
• Strongly Connected Components
• Minimum Spanning Trees
• Lecture 18 Notes
• Single Source Shortest Paths
• Lecture 19 Notes
• All Pairs Shortest Paths
• Lecture 20 Notes
• Max Flows
• Ford-Fulkerson example
• The paper on the Soviet rail system appears here .
• Lecture 21 Notes
• Garey and Johnson cartoon
• NP-completeness
• Lecture 22 Notes
• Lecture 23 Notes
• Lecture 24 Notes
• A TSP site from GA Tech
• Lecture 25 Notes
• Lecture 26 Notes

Course Announcements

• Midterm is here.