Skip to main content

Part of the book series: Macmillan Computer Science Series

  • 29 Accesses

Abstract

Much of our experience in both programming and the real world concerns the manipulation of the ‘small rather than the large’. For this we are to be thankful, for once we depart the realm of the small, many trivial operations take on a frightening complexity requiring painstaking organisation. The lifting of an object weighing 1 kg is trivial, 50 kg is difficult but possible, 2500 kg is, for the average human, impossible. A ‘mere’ quantitative change causes a qualitative change in the nature of the problem. We must expect therefore that once we include the ‘large’ in a problem we are most likely introducing with it a number of difficulties. This certainly applies to data structures which are in some sense ‘large’.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1978 Derek Coleman

About this chapter

Cite this chapter

Coleman, D. (1978). Dynamic Data Structures. In: A Structured Programming Approach to Data. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-15981-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-15981-9_8

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-21943-0

  • Online ISBN: 978-1-349-15981-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics