# Heapsort and Binary Heaps: Samuel’s guide

**Summary:**Samuel's tutorial on heapsort and binary heaps.

**Topics:**Heapsort, binary heap, priority queue, data structures, algorithms, coding

**Slides:**link (pdf)

**References**

- J. Williams, "Algorithm 232 – Heapsort", Communications of the ACM (1964)
- R. Floyd, "Algorithm 245 – Treesort 3", Communications of the ACM (1964)
- "Introsort", https://en.wikipedia.org/wiki/Introsort (accessed 2022-12)
- "Binary Heap", https://en.wikipedia.org/wiki/Binary_heap (accessed 2022-12)
- T. Cormen et al., "Introduction to algorithms", Chap 6, MIT press (2022)
- "Priority Queue", https://en.wikipedia.org/wiki/Priority_queue (accessed 2022-12)
- M. T. Goodrich et al., "Algorithm design and applications", Chap. 5 (2015)
- L. Xinyu, "Elementary Algorithms", Chap. 8 (2022)
- H. Ding, "Proof for The Complexity of Building A Heap", https://www.cse.msu.edu/~huding/331material/timecomplexity_for_heap.pdf (accessed 2022-12)