Abstract
On one of those evenings when it seems you have done nothing all day but store and retrieve things, have a kindred thought for your programs. Many of them — like Traffic with its list-like structures representing metro lines — spend a good deal of their time putting objects into repositories and searching for previously stored objects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meyer, B. (2013). Fundamental data structures, genericity, and algorithm complexity. In: Touch of Class. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92145-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-92145-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92144-8
Online ISBN: 978-3-540-92145-5
eBook Packages: Computer ScienceComputer Science (R0)