CMSC 351 Algorithms, Spring, 2011

• Summation Resources: 
• Wikipedia 
• Counting and Comparison Resources: 
• Maurer Notes 
• Analyzing Recurrence Relations: 
• Handwritten Recurrence Trees 
• Stackoverflow - Iteration 
• UC Riverside Recurrence Tutorial 
• Recurrence Relations a la Duke 
• Graphing with Gnuplot: 
• Homepage 
• Addendum to Lecture 2/21: 
• Generic Mergesorts 
• Dynamic Programming: 
• Fibonacci 
• Maximum Continuous Subarray 
• Homework 3: 
• Problem 4.5, page 1 and page 2  
• Sorting: 
• Sorting Animations 
• Counting Sort 
• Radix Sort 
• More Radix Sort 
• How to Pronounce "Radix" 
• Fibonacci and AVL Trees: 
• Fibonacci Numbers and Induction 
• Fibonacci Numbers (a la Python?) 
• Graphs and MSTs: 
• Prim's Algorithm Wiki 
• Animated Prim 
• Animated Kruskal 
• Animated Graph Algorithms 
• More Animated Algorithms 
• Tree Growing: 
• Carl Kingsford's Tree Growing Notes 
• More of Carl's Notes 
• NP-Completeness: 
• Definitions 
• 3SAT 
• Vertex Cover 
• Reduction from 3SAT to VC 
• Another 3SAT/VC Reduction 
• Other NP Complete Problems