Lectures and Recitations
From 6.006: Introduction to Algorithms
(Difference between revisions)
| Line 2: | Line 2: | ||
* [[Recitation 2]]: Document Distance; Flatten | * [[Recitation 2]]: Document Distance; Flatten | ||
* [[Recitation 3]]: Maximum Contiguous Subvector | * [[Recitation 3]]: Maximum Contiguous Subvector | ||
| − | * [[Recitation 4]]: | + | * [[Recitation 4]]: BST Augmentation; Python OO |
| − | * [[Recitation 5]]: Balanced BSTs | + | * [[Recitation 5]]: Rotations; Balanced BSTs |
* [[Recitation 6]]: Hashing; hash() | * [[Recitation 6]]: Hashing; hash() | ||
* [[Recitation 7]]: String Matching; Rabin-Karp | * [[Recitation 7]]: String Matching; Rabin-Karp | ||
Revision as of 03:11, 11 October 2007
- Recitation 1: Document Distance; Python Lists
- Recitation 2: Document Distance; Flatten
- Recitation 3: Maximum Contiguous Subvector
- Recitation 4: BST Augmentation; Python OO
- Recitation 5: Rotations; Balanced BSTs
- Recitation 6: Hashing; hash()
- Recitation 7: String Matching; Rabin-Karp
- Recitation 8: Hash Tables
- Recitation 9: Image Resizing; Matrix Chain Multiplication
- Recitation 10: Stamps; Longest Increasing Subsequence; Knapsack
