Algorithm Analysis Journal

Alyssa's Journal

• Preface
• Stable Matching
• Computational Tractability
• Asymptotic Order of Growth
• Stable Matching w/Lists and Arrays
• A Survey of Common Running Times
• Priority Queues
• Graphs: Basic Definitions and Algorithms
• Graph Connectivity and Traversal
• Implementing Graph Traversal w/Queues and Stacks
• Testing Bipartiteness
• Connectivity in Directed Graphs
• Directed Acyclic Graphs & Topological Ordering
• Introduction to Greedy Algorithms
• Interval Scheduling
• Minimizing Lateness
• Shortest Paths in Graphs
• Minimum Spanning Trees
• Kruskal's Algorithm
• Clustering
• Huffman Codes
• Mergesort
• Recurrence Relations
• Counting Inversions
• Finding the Closest Pair of Points
• Weighted Interval Scheduling
• Memoization
• Segmented Least Squares
• Subset Sums and Knapsacks
• The Maximum Flow Problem and the Ford-Fulkerson Algorithm
• Maximum Flows and Minimum Cuts in a Network
• The Bipartite Matching Problem
• Extensions to the Maximum Flow Problem

---

←CSCI 211: Algorithm Design and Analysis