Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
| Line 21: | Line 21: | ||
=== Binary Search Trees === | === Binary Search Trees === | ||
| - | ==== Lecture 3, Binary Search Trees ==== | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture3.pdf Lecture 3], Binary Search Trees ==== |
| + | * [http://courses.csail.mit.edu/6.006/fall08/source/runway.py <code>runway.py</code>] code from class | ||
* Readings: CLRS Chapter 10; Chapter 12, Sections 1-3 | * Readings: CLRS Chapter 10; Chapter 12, Sections 1-3 | ||
Revision as of 22:54, 11 September 2008
Contents |
Introduction and Document Distance
Lecture 1, Introduction and Document Distance
- Document Distance (docdist{1,2,3,4}.py)
- Readings: CLRS Chapters 1,2,3
Recitation 1
Lecture 2, Document Distance, Mergesort
- Document Distance (docdist{5,6}.py)
-
mergesort.pycode from class - Readings:
- CLRS Chapter 11, Sections 1-2; CLRS Chapter 4
- Python Cost Model
Recitation 2
- Jon Bentley's column on the maximum sum contiguous vector problem discussed in class
- Recitation02 Notes
Binary Search Trees
Lecture 3, Binary Search Trees
-
runway.pycode from class - Readings: CLRS Chapter 10; Chapter 12, Sections 1-3
