Abstract
Perhaps the world’s oldest data structures were the tablets in cuneiform script used more than 5000 years ago by custodians in Sumerian temples. These custodians kept lists of goods, and their quantities, owners, and buyers. The picture on the left shows an example. This was possibly the first application of written language. The operations performed on such lists have remained the same – adding entries, storing them for later, searching entries and changing them, going through a list to compile summaries, etc. The Peruvian quipu [225] that you see in the picture on the right served a similar purpose in the Inca empire, using knots in colored strings arranged sequentially on a master string. It is probably easier to maintain and use data on tablets than to use knotted string, but one would not want to haul stone tablets over Andean mountain trails. It is apparent that different representations make sense for the same kind of data.
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
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sanders, P., Mehlhorn, K., Dietzfelbinger, M., Dementiev, R. (2019). Representing Sequences by Arrays and Linked Lists. In: Sequential and Parallel Algorithms and Data Structures. Springer, Cham. https://doi.org/10.1007/978-3-030-25209-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-25209-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25208-3
Online ISBN: 978-3-030-25209-0
eBook Packages: Computer ScienceComputer Science (R0)