MIT OpenCourseWare

Browse materialsMIT 6.006 · Fall 2011

Introduction to Algorithms

Art: not stated, Fletcher's Combined Block Telegraph Apparatus and Bell, 1889 · Public domain

Instructors: Prof. Erik Demaine, Prof. Srini Devadas
Term: Fall 2011
Level: Undergraduate
What's inside: 47 videos · 15 problem sets · 6 exams · 17 solutions · 1 lecture note · 1 reading · 4 handouts · 114 other files · 8 web pages
Materials open: Videos here · files on MIT OCW

Other versions of this course

6.006 · Spring 2020 · Study here
6.006 · Fall 2011 · Study here (this version)
6.006 · Spring 2008 · Study here

Start here

Start course: Lecture 1: Algorithmic Thinking, Peak Finding Find a topic

Progress is saved in this browser.

Export or import progress

About this course

Source: MIT OpenCourseWare 6.006 Introduction to Algorithms, Fall 2011, Prof. Erik Demaine, Prof. Srini Devadas — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 22, 2026. How RedLectern is built.

Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.

Has MIT solutions 17 files in this course are named by MIT as solutions.

Before you start

Prerequisites are not listed here. Check MIT's own syllabus for this course.

This course’s cited books, in our reading lists: Introduction to Algorithms · Problem Solving with Algorithms and Data Structures Using Python

How this course was organized

What's here, and what isn't

MIT's own materials here did not support a verified, course-wide order, so they are grouped by section instead.

Not included here

32 items from the source could not be safely included:

MIT's page format for this item wasn't recognized clearly enough to place it safely. (30 items)
Referenced in a table, but without MIT's own verified order, so it isn't used to claim a sequence. (2 items)

Materials by section

Grouped by section, as MIT organized them. Not sequenced or ordered.

Readings

Python Cost Model

Binary Search Trees

Lecture Notes

39 files

Recitation Videos

23 videos

Assignments

30 files

Exams

Other materials from this course

28 files

47 video transcripts

MIT OpenCourseWare, Prof. Erik Demaine, Prof. Srini Devadas, 6.006 Introduction to Algorithms, Fall 2011.

License: CC BY-NC-SA 4.0 · Edition: Fall 2011 · Open the original course on OCW ↗

Organized by RedLectern, independent of MIT and not endorsed by MIT.

Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.

Introduction to Algorithms

Before you start

What's here, and what isn't

Not included here

Materials by section

Readings

Python Cost Model

Binary Search Trees

Lecture Notes

Recitation Videos

Assignments

Exams

Other materials from this course

Lecture 1: Algorithmic Thinking, Peak Finding

Lecture 2: Models of Computation, Document Distance

Lecture 3: Insertion Sort, Merge Sort

Lecture 4: Heaps and Heap Sort

Lecture 5: Binary Search Trees, BST Sort

Lecture 6: AVL Trees, AVL Sort

Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting

Lecture 8: Hashing with Chaining

Lecture 9: Table Doubling, Karp-Rabin

Lecture 10: Open Addressing, Cryptographic Hashing

Lecture 11: Integer Arithmetic, Karatsuba Multiplication

Lecture 12: Square Roots, Newton's Method

Lecture 13: Breadth-First Search (BFS)

Lecture 14: Depth-First Search (DFS), Topological Sort

Lecture 15: Single-Source Shortest Paths Problem

Lecture 16: Dijkstra

Lecture 17: Bellman-Ford

Lecture 18: Speeding up Dijkstra

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Lecture 20: Dynamic Programming II: Text Justification, Blackjack

Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.

Lecture 23: Computational Complexity

Lecture 24: Topics in Algorithms Research