Name: Lecture 8: Binary Heaps
Uploaded: 2021-09-13T16:20:05Z
Duration: 50 min 52 s
Description: 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

50:52

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