Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms

ISA 1991: ISA'91 Algorithms pp 263–272Cite as

Historical searching and sorting

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 557))

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.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. G.N. Frederickson. Self-organizing heuristics for implicit data structures. SIAM Journal on Computing, 13:277–291, 1984.

    Google Scholar 

  3. G.N. Frederickson. Implicit data structures for weighted elements. Information and Computation, 66:61–82, 1985.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. D.E. Knuth. The Art of Computer Programming, Vol. S: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  7. H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers, C-34(4):318–325, 1985.

    Google Scholar 

  8. C. Martel. Self-adjusting multi-way search trees. Information Processing Letters, 38(3):135–142, 1991.

    Google Scholar 

  9. K. Mehlhorn. Data Structures and Algorithms, Vol 1: Sorting and Searching. Springer-Verlag, Berlin/Heidelberg, F.R.Germany, 1984.

    Google Scholar 

  10. O. Petersson and A.M. Moffat. A framework for adaptive sorting. Manuscript, February 1991.

    Google Scholar 

  11. D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652–686, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Comp. Sc., The University of Melbourne, 3052, Victoria, Australia

    Alistair Moffat

  2. Dept. Comp. Sc., Lund University, Box 118, S-22100, Lund, Sweden

    Ola Petersson

Authors
  1. Alistair Moffat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ola Petersson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wen-Lian Hsu R. C. T. Lee

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation