====== Algorithm Analysis Journal ======

[[courses:cs211:winter2014:journals:alyssa:home|Alyssa's Journal]]

  * [[Preface|Preface]]
  * [[Chapter1.1|Stable Matching]]
  * [[Chapter2.1|Computational Tractability]]
  * [[Chapter2.2|Asymptotic Order of Growth]]
  * [[Chapter 2.3|Stable Matching w/Lists and Arrays]]
  * [[Chapter 2.4|A Survey of Common Running Times]]
  * [[Chapter 2.5|Priority Queues]]
  * [[Chapter 3.1|Graphs: Basic Definitions and Algorithms]]
  * [[Chapter 3.2|Graph Connectivity and Traversal]]
  * [[Chapter 3.3|Implementing Graph Traversal w/Queues and Stacks]]
  * [[Chapter 3.4|Testing Bipartiteness]]
  * [[Chapter 3.5|Connectivity in Directed Graphs]]
  * [[Chapter 3.6|Directed Acyclic Graphs & Topological Ordering]]
  * [[Chapter 4|Introduction to Greedy Algorithms]]
  * [[Chapter 4.1|Interval Scheduling]]
  * [[Chapter 4.2|Minimizing Lateness]]
  * [[Chapter 4.4|Shortest Paths in Graphs]]
  * [[Chapter 4.5|Minimum Spanning Trees]]
  * [[Chapter 4.6|Kruskal's Algorithm]]
  * [[Chapter 4.7|Clustering]]
  * [[Chapter 4.8|Huffman Codes]]
  * [[Chapter 5.1|Mergesort]]
  * [[Chapter 5.2|Recurrence Relations]]
  * [[Chapter 5.3|Counting Inversions]]
  * [[Chapter 5.4|Finding the Closest Pair of Points]]
  * [[Chapter 6.1|Weighted Interval Scheduling]]
  * [[Chapter 6.2|Memoization]]
  * [[Chapter 6.3|Segmented Least Squares]]
  * [[Chapter 6.4|Subset Sums and Knapsacks]]
  * [[Chapter 7.1|The Maximum Flow Problem and the Ford-Fulkerson Algorithm]]
  * [[Chapter 7.2|Maximum Flows and Minimum Cuts in a Network]]
  * [[Chapter 7.5|The Bipartite Matching Problem]]
  * [[Chapter 7.7|Extensions to the Maximum Flow Problem]]

----
<-[[courses:cs211:winter2014:home|CSCI 211: Algorithm Design and Analysis]]