Previous Lecture | lect14 | Next Lecture |
Code written in class
https://github.com/ucsb-cs24-f19-nichols/code-from-class/tree/master/11-19
Written notes
Go here and select the appropriate date: https://1drv.ms/o/s!AlgIeD1urAgmgQlHpyss6qfDD-Xm
- Two different views of the heap : tree and array
- Operations supported by heaps
- Under the hood of heaps: min (or max), insert, delete min (or delete max)
- Applications for fast sorting