Lecture Videos
Lecture 8: Binary Heaps
Viewing videos requires an internet connection
Prof. Demaine discusses priority queue interfaces and sorting algorithms. Algorithms include AVL sort for set AVL trees, selection sort for arrays, insertion sort for sorted arrays, and heap sort for binary heaps.
Instructor: Erik Demaine
Course Info
Instructors
Departments
As Taught In
Spring
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
notes
Lecture Notes
