Abstract
A data structure with homogeneous elements is linear if it organizes its elements into a sequence. In a computer, each data structure is finite in terms of the number of its elements. A linear data structure has a first and a last element. Each of the other elements in the linear data structure has a predecessor and a successor.
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.
References
A. C. Yao and F. F. Yao. The Complexity of Searching an Ordered Random Table. Proceedings of the 17 th Annual IEEE Symposium on Foundations of Computer Science, 1976, pp. 173–176.
Y. Perl, A. Itai, and H. Avni. Interpolation Search — A Log Log N Search. CACM. 21 (1978) pp. 550–553.
G. H. Gonnet, L. D. Rogers, and J. A. George. An Algorithmic and Complexity Analysis of Interpolation Search. Acta Informatica 13 (1980) pp. 39–52.
D. E. Knuth. The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Li, L. (1998). Linear Data Structures. In: Java: Data Structures and Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95851-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-95851-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95853-3
Online ISBN: 978-3-642-95851-9
eBook Packages: Springer Book Archive