Abstract
Before leaving the topic of list structures, this chapter presents two useful utility modules using singly-linked unbounded lists. The first (Sections 8.1 and 8.2) provides search routines for unordered lists; the second (Sections 8.3 and 8.4) contains a sampling of list constructors and selectors built on top of the primitive list operations developed in Chapter 4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.
J.L. Bentley and C.C. McGeoch, Worst-Case Analyses of Self-Organizing Sequential Search Heuristics, Carnegie-Mellon University, 1983.
G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.
G.H. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley, London England 1984.
D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.
N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Lins, C. (1989). List Utilities. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6396-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6396-5_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-6398-9
Online ISBN: 978-1-4684-6396-5
eBook Packages: Springer Book Archive