Log inSign up

Home / Lectures / Introduction to Algorithms

Still from the lecture
Computer Science

Lecture 4: Heaps and Heap Sort

Course
Introduction to Algorithms
Instructor
Srini Devadas
Department
Electrical Engineering and Computer Science
Recorded
Fall 2011
Level
Undergraduate
▶ Watch the lecture

Free account required. The lecture opens at MIT OpenCourseWare.

About this lecture

Priority queues are introduced as a motivation for heaps. The lecture then covers heap operations and concludes with a discussion of heapsort.

← Lecture 3: Insertion Sort, Merge SortLecture 5: Binary Search Trees, BST Sort →

More in Computer Science

Still from the lecture “Lecture 1: What is Computation?”
Computer Science

Lecture 1: What is Computation?

Introduction to Computer Science and Programming in Python · Dr. Ana Bell

Still from the lecture “Lecture 2: Branching and Iteration”
Computer Science

Lecture 2: Branching and Iteration

Introduction to Computer Science and Programming in Python · Dr. Ana Bell

Still from the lecture “Lecture 3: String Manipulation, Guess and Check, Approximations, Bisection”
Computer Science

Lecture 3: String Manipulation, Guess and Check, Approximations, Bisection

Introduction to Computer Science and Programming in Python · Dr. Ana Bell