Lecture 4: Heaps and Heap Sort

Name: Lecture 4: Heaps and Heap Sort
Uploaded: 2013-01-14T20:26:48Z
Duration: 52 min 32 s
Description: 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

52:32

Up Next

Lecture 5: Binary Search Trees, BST Sort

Continue

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