This is my personal archive. It contains notes and code from my teaching, research, and non-academic projects. Hope you find it useful!
My research-ish homepage is here.
Contents
Data Structures and Algorithms
- Running Time
- Divide and Conquer Part 1 (Tiling Puzzle, Binary Search, Merge Sort, Solving Recurrences)
- Divide and Conquer Part 2 (Majority Element, Strassen's Algorithm)
- Divide and Conquer Part 3 (Karatsuba's Algorithm, Linear Time Selection)
- Dynamic Programming Part 1 (Fibonacci, Shortest Path in DAG, LIS, Edit Distance)
- Dynamic Programming Part 2 (LCS, Knapsack, Weighted Interval Scheduling)
- Heaps
- Prefix Sum and Difference Array
- Greedy Algorithms Part 1 (Files on Tape, Huffman Coding)
- Graph Representations and Depth First Search (DFS)
- Strongly Connected Components (SCC)
- Breadth-First Search (BFS)
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- NP-Hardness Part 1 (Decision Problems, P, Reductions, NP)
- NP-Hardness Part 2 (NP-Hard, NP-Complete, SAT, Cook-Levin, Reductions)
- NP-Hardness Part 3 (Clique, Vertex Cover)