Computer Science Fundamentals (CS153 2004S)

Class 50: Priority Queues, Heaps, and Heap Sort

Back to Cancelled. On to The Dictionary ADT.

Held: Thursday, 29 April 2004

Summary: Today we consider another linear structure, the priority queue, and some implementations of priority queues.

Related Pages:

Due

Assignments:

Notes:

Overview:

Introduction to Priority Queues

Implementing Priority Queues

A Simple Implementation

Implementing with Sorted Structures

A Binary Implementation

Detour: Tree Terminology

Implementation of Key Operations

An Introduction to Heaps

The Heap Property

Examples

Heap Operations

Adding to Heaps

Deleting Elements from Heaps

Implementing Heaps with Arrays

Heap Sort

 

History

 

Back to Cancelled. On to The Dictionary ADT.

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 Fri May 7 09:43:34 2004.
The source to the document was last modified on Tue Jan 13 10:26:12 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.50.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu