MIT 6.006 Lecture 4: Priority Queues, Binary Heaps & O(n) Build-Max-Heap
Visualizes implicit array-backed binary trees and proves why bottom-up Build-Max-Heap runs in linear O(n) time rather than O(n log n).
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Srini Devadas
More courses at http://ocw.mit.edu
Previous · Lecture 3
MIT 6.006 Lecture 3: Insertion Sort, Binary Insertion & Merge Sort Recurrences
Next · Lecture 5MIT 6.006 Lecture 5: Binary Search Trees & Runway Reservation Scheduling
Comments
Add a comment...Sign in