Overview
This is a generic algorithms package that provides 31 algorithms for manipulating a linked list representation of sequences. Only a singly-linked representation is assumed, but many of the algorithms can also reasonably be used with other representations such as circular or non-circular doubly-linked representations. As can be seen from the subprogram implementations in the previous chapter, even for a singly-linked representation these algorithms can be instantiated in various ways to produce a substantially larger collection of useful operations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Musser, D.R., Stepanov, A.A. (1989). Linked List Algorithms Package. In: The Ada® Generic Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-7089-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-7089-5_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-7091-8
Online ISBN: 978-1-4684-7089-5
eBook Packages: Springer Book Archive