Fundamentals of Computer Science II (CSC-152 99F)


Class 37: Heaps and Heap Sort

Back to Introduction to Linear Structures. On to Linear Structures for Solving Puzzles.

Held Thursday, November 4, 1999

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

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, 10 August 1999

Wednesday, 3 November 1999

Back to Introduction to Linear Structures. On to Linear Structures for Solving Puzzles.


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/99F/Outlines/outline.37.html

Source text last modified Wed Nov 3 16:58:12 1999.

This page generated on Thu Nov 4 20:58:40 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu