Resources on Algorithms

1. MIT's Introduction to Algorithms video lectures
   • Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method
   • Lecture 10: Red-black Trees, Rotations, Insertions, Deletions
   • Lecture 16: Greedy Algorithms, Minimum Spanning Trees
   • Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
2. Sorting algorithms animations:
   • Insertion sort, etc.
   • Comparison Sorting Algorithms
   • What's the fastest way to alphabetize your bookshelf? (Explains Bubble sort, Insertion sort, and Quicksort)
3. Asymptotic notations:
   • Big O Notation Tutorial - A Guide to Big O Analysis
   • Big O vs Theta Θ vs Big Omega Ω Notations
   • Asymptotic notation cheat sheet
4. Data Structure Visualizations
5. PowerPoint slides from CS372 taught in Fall 2005:
   • Why study algorithms?
   • Induction, Insertion Sort, Asymptotic Notations
   • Asymptotic Notations
   • Merge Sort
   • Recurrences
   • HeapSort
   • QuickSort
   • Hash Tables
   • Binary Search Trees
   • Dynamic Programming and memoization
   • Dynamic Programming: assembly line scheduling
   • Greedy Algorithms
6. Algorithms and Complexity by Herbert S. Wilf
7. Mathematical induction
8. Algorithms from Wikibooks, the open-content textbooks collection.
9. Hash Tables