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


Class 44: Priority Queues, Heaps, and Heap Sort

Back to Implementing Linear Structures. On to Automated Problem Solving with Linear Structures.

Held Wednesday, November 15, 2000

Summary

Today's course outline does not yet have a summary. Please remind me to create one.

Notes

Overview


What? Do you really think that I have my notes on Priority Queues, Heaps, and Heap Sort prepared this far in advance of the class?


History

Wednesday, 23 August 2000

Thursday, 24 August 2000

Back to Implementing Linear Structures. 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.cs.grinnell.edu/~rebelsky/Courses/CS152/2000F/Outlines/outline.44.html

Source text last modified Wed Oct 25 10:05:37 2000.

This page generated on Fri Nov 17 08:54:54 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu