MIT

Lecture 4: Heaps and Heap Sort

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering

Om kurset

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