Fund. CS II (CS152 2004F)

Class 36: Heaps and Heap Sort

Back to Project Discussion. On to Dictionaries (1).

Held: Wednesday, 3 November 2004

Summary: Today we consider heaps, an important implementation of priority queues, and their use in sorting values.

Related Pages:




A Binary Implementation

Detour: Tree Terminology

Implementation of Key Operations

An Introduction to Heaps

The Heap Property


Heap Operations

Adding to Heaps

Deleting Elements from Heaps

Implementing Heaps with Arrays

Heap Sort

Back to Project Discussion. On to Dictionaries (1).

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 8 10:37:23 2004.
The source to the document was last modified on Thu Aug 26 20:22:24 2004.
This document may be found at

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky,