Log inSign up

Home / Courses

Computer Science

Introduction to Algorithms

Electrical Engineering and Computer Science · Srini Devadas · Fall 2011 · Undergraduate

This course is published by MIT OpenCourseWare. Below are the lectures we have indexed, in the order they were taught. For problem sets, notes and exams, visit the original course page.

  1. Lecture 1: Algorithmic Thinking, Peak Finding
  2. Lecture 2: Models of Computation, Document Distance
  3. Lecture 3: Insertion Sort, Merge Sort
  4. Lecture 4: Heaps and Heap Sort
  5. Lecture 5: Binary Search Trees, BST Sort
  6. Lecture 6: AVL Trees, AVL Sort
  7. Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
  8. Lecture 8: Hashing with Chaining
  9. Lecture 9: Table Doubling, Karp-Rabin
  10. Lecture 10: Open Addressing, Cryptographic Hashing
  11. Lecture 11: Integer Arithmetic, Karatsuba Multiplication
Still from the lecture “Lecture 1: Algorithmic Thinking, Peak Finding”
Computer Science

Lecture 1: Algorithmic Thinking, Peak Finding

Introduction to Algorithms · Srini Devadas

Still from the lecture “Lecture 2: Models of Computation, Document Distance”
Computer Science

Lecture 2: Models of Computation, Document Distance

Introduction to Algorithms · Erik Demaine

Still from the lecture “Lecture 3: Insertion Sort, Merge Sort”
Computer Science

Lecture 3: Insertion Sort, Merge Sort

Introduction to Algorithms · Srini Devadas

Still from the lecture “Lecture 4: Heaps and Heap Sort”
Computer Science

Lecture 4: Heaps and Heap Sort

Introduction to Algorithms · Srini Devadas

Still from the lecture “Lecture 5: Binary Search Trees, BST Sort”
Computer Science

Lecture 5: Binary Search Trees, BST Sort

Introduction to Algorithms · Srini Devadas

Still from the lecture “Lecture 6: AVL Trees, AVL Sort”
Computer Science

Lecture 6: AVL Trees, AVL Sort

Introduction to Algorithms · Erik Demaine