Algorithms and OOD (CSC 207 2013F) : Outlines

Outline 50: Heap Sort

Held: Tuesday, 3 December 2013

Back to Outline 49 - Heaps. On to Outline 51 - Dynamic Programming.


We ground our understanding of heaps and heap sort by developing a heap sort algorithm and modifying our heap implementation.

Related Pages




Copyright (c) 2013 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.