Stop learning alone!

Learn faster and stay on-track by joining this free class with other self-learners.

Introduction to Algorithms (MIT 6.046J)

Class length: 16 weeks. Start anytime.

Creator: CoreyWhite

Status: Established

Join this class!

Course Home
Members
Forum
Dashboard
Lessons
1. Week 1
2. Week 2
3. Week 3 - PS 1
4. Week 4
5. Week 5 - PS 2 & 3
6. Week 6 - Quiz 1
7. Week 7
8. Week 8 - PS 4
9. Week 9 - PS 5
10. Week 10 - PS 6
11. Week 11 - PS 7
12. Week 12 - PS 8
13. Week 13 - Quiz 2
14. Week 14 - PS 9
15. Week 15
16. Week 16 - Final

Lectures

Lecture links to the MIT OCW site include the video or audio lecture itself in several formats, along with a transcript and a PDF set of lecture notes.

Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
Lecture 6: Order Statistics, Median

(Videos are also embedded below)

Readings

All readings, unless otherwise specified, are from Introduction to Algorithms, 2nd Edition.

After Lecture 5:
- Sections 8.1-8.3
- Chapter 7
After Lecture 6:
- Chapter 9
Prior to Lecture 7 (originally for recitation):
- Section 8.4

Other material

Optional:
- Peteris Krumins' comments and lecture notes for Lectures 4 and 5 (only the portion on Lecture 5 is relevant to this week's lesson)
- Peteris Krumins' comments and lecture notes for Lecture 6

Assignment Notes

Assignments are listed under the Curious Reef "lesson" containing the lecture on which they were due, rather than the lesson containing the lecture when they were assigned.

After this week's lesson, you will be ready to complete Problem Set 2, which is due next week. There are two assignments next week, so it is highly recommended to start this one now!

Videos

Lecture 5:

Lecture 6:

Assignments

No assignments for this lesson.