Home » Courses » Electrical Engineering and Computer Science » Introduction to Algorithms » Lecture Videos » Lecture 4: Heaps and Heap Sort

Lecture 4: Heaps and Heap Sort

Flash and JavaScript are required for this feature.

Download the video from iTunes U or the Internet Archive.

About this Video
Playlist
Lecture Notes
Download this Video

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

Instructor: Srini Devadas

MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.

© 2001–2012
Massachusetts Institute of Technology

Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.