Abstract
A ‘move to the front’ dictionary data structure that supports O(log t) time access to objects last accessed t operations ago is described. This ‘Historical Search Tree’ is then used in two adaptive sorting algorithms. The first algorithm, ‘Historical Insertion Sort’, exploits the temporal locality present in a nearly sorted list rather than the more normally exploited spatial locality. The second of the new algorithms, ‘Regional Insertion Sort’, exploits both temporal and spatial locality. Regional Insertion Sort also gives rise to a new measure of presortedness Reg that is superior to all known measures of presortedness, in that any sequence regarded as nearly sorted by any other measure will also be regarded as nearly sorted by the measure Reg.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Carlsson, C. Levcopoulos, and O. Petersson. Sublinear merging and Natural Mergesort. In Proc. SIGAL International Symposium on Algorithms, pages 251–260. LNCS 450, Springer-Verlag, 1990.
G.N. Frederickson. Self-organizing heuristics for implicit data structures. SIAM Journal on Computing, 13:277–291, 1984.
G.N. Frederickson. Implicit data structures for weighted elements. Information and Computation, 66:61–82, 1985.
L.J. Guibas, E.M. McCreight, M.F. Plass, and J.R. Roberts. A new representation of linear lists. In Proc. 9th Annual ACM Symposium on Theory of Computing, pages 49–60, 1977.
J. Katajainen, C. Levcopoulos, and O. Petersson. Local Insertion Sort revisited. In Proc. International Symposium on Optimal Algorithms, pages 239–253. LNCS 401, Springer-Verlag, 1989.
D.E. Knuth. The Art of Computer Programming, Vol. S: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers, C-34(4):318–325, 1985.
C. Martel. Self-adjusting multi-way search trees. Information Processing Letters, 38(3):135–142, 1991.
K. Mehlhorn. Data Structures and Algorithms, Vol 1: Sorting and Searching. Springer-Verlag, Berlin/Heidelberg, F.R.Germany, 1984.
O. Petersson and A.M. Moffat. A framework for adaptive sorting. Manuscript, February 1991.
D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652–686, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moffat, A., Petersson, O. (1991). Historical searching and sorting. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_70
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive