Fundamentals of Computer Science II (CSC-152 2000S)


Class 39: Priority Queues, Heaps, and Heap Sort

Back to Implementing Stacks and Queues. On to Automated Problem Solving with Linear Structures.

Held Wednesday, April 12, 2000

Overview

Today we will consider heaps, one of the more efficient implementations of priority queues. Heaps are interesting in that they represent the application of the ``divide and conquer'' technique to data structures.

Notes

Contents

Summary


Priority Queues

A Simple Implementation

Representing Priority Queues

An Introduction to Heaps

Tree Terminology

The Heap Property

Examples

Heap Operations

Adding

Deleting an Element

Implementing Heaps with Arays

Heap Sort


History

Tuesday, 18 January 2000

Wednesday, 12 April 2000

Back to Implementing Stacks and Queues. On to Automated Problem Solving with Linear Structures.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/2000S/Outlines/outline.39.html

Source text last modified Wed Apr 12 10:49:27 2000.

This page generated on Fri Apr 14 10:00:25 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu