Abstract
Different methods of organizing information lead to various method of seeking objects. Chapter 7 described several important search and update methods based on tree structures. This chapter describes several classical search and update techniques based on array access. Each technique depends on a particular array organization method and involves tradeoffs between the algorithm that organizes the data and the algorithm that searches for information.Searchingis the seeking of a particular object in a structure. In this chapter, the structures happen to be arrays.Updatingrefers to the process of adding one or more objects to a structure.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Beidler, J. (1997). Search/Update. In: Data Structures and Algorithms. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1854-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1854-8_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7312-7
Online ISBN: 978-1-4612-1854-8
eBook Packages: Springer Book Archive