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


Class 43: Implementing Linear Structures

Back to Introduction to Linear Structures. On to Priority Queues, Heaps, and Heap Sort.

Held Tuesday, November 14, 2000

Summary

Today we consider techniques for implementing the various linear structures.

Notes

Overview


Basic Implementation Techniques

Priority Queues

Heaps


History

Wednesday, 23 August 2000

Thursday, 24 August 2000

Tuesday, 14 November 2000

Back to Introduction to Linear Structures. On to Priority Queues, Heaps, and Heap Sort.


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.43.html

Source text last modified Tue Nov 14 08:58:01 2000.

This page generated on Tue Nov 14 08:59:40 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu