Computer Science Fundamentals (CS153 2003S)

Class 49: Priority Queues, Heaps, and Heap Sort

Back to LInear Structures. On to The Dictionary ADT.

Held: Monday, 28 April 2003

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

Related Pages:

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

Thursday, 15 January 2003 [Samuel A. Rebelsky]

Sunday, 27 April 2003 [Samuel A. Rebelsky]

 

Back to LInear Structures. 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 Tue May 6 09:21:08 2003.
The source to the document was last modified on Sun Apr 27 23:27:36 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/outline.49.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu