Lectures and Recitations
From 6.006 Introduction to Algorithms
(Difference between revisions)
(add readings) |
(rewrite) |
||
| Line 18: | Line 18: | ||
* [http://courses.csail.mit.edu/6.006/spring08/notes/lecture4.pdf Lecture 4], Balanced Binary Search Trees | * [http://courses.csail.mit.edu/6.006/spring08/notes/lecture4.pdf Lecture 4], Balanced Binary Search Trees | ||
| - | ** Readings: CLRS, sections | + | ** Readings: CLRS, chapter 13, sections 1 and 2 for a different approach (red-black trees) |
Revision as of 15:13, 14 February 2008
- Lecture 1, Introduction and Document Distance
- Document Distance
- Readings: CLRS, chapters 1, 2, 3.
- Recitation 1, Document Distance in Python (docdist{1,2,3,4}.py)
- Victor's Slides [PDF] | [Zipped Keynote]
- Lecture 2, More Document Distance, Mergesort
- Readings: CLRS, chapter 11, sections 1 and 2.
- Recitation 2, Python Cost Model, Review for Asymptotic Notation & Mergesort
- Victor's Slides [PDF] | [Zipped Keynote] | [Zipped Data (Numbers)]
- Python Cost Model
- Lecture 3, Airplane scheduling; Binary Search Trees
- Recitation 3, Binary Search Trees
- Victor's Slides [PDF] | [Zipped Keynote]
- Code for Binary Search Trees augmented with subtree size [Python]
- Lecture 4, Balanced Binary Search Trees
- Readings: CLRS, chapter 13, sections 1 and 2 for a different approach (red-black trees)
