Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1992: STACS 92 pp 581–587Cite as

In-place linear probing sort

  • Conference paper
  • First Online:

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

Abstract

We introduce the first sorting algorithm that is proven to sort n randomly drawn uniformly distributed elements in θ(n) time in situ. The constants in this algorithm are small, and simulations have shown it competitive with other sorting algorithms. It is, furthermore, conceptually simple and easy to code, which makes it a practical distributive sorting algorithm.

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. O. Amble and D. E. Knuth, Ordered hash tables, Computer Journal, 17(2):135–142, (May 1974)

    Google Scholar 

  2. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Computer System Science, 18:155–193, (1979)

    Google Scholar 

  3. R. W. Floyd and R. L. Rivest, Expected time bounds for selection, Communications of the ACM, 18(3):165–172, (Mar. 1975)

    Google Scholar 

  4. G. H. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading Mass., (1984)

    Google Scholar 

  5. G. H. Gonnet and J. I. Munro, The analysis of Linear Probing Sort by the use of a new mathematical transform, Journal of Algorithms 5,(1984), 451–470.

    Google Scholar 

  6. T. F. Gonzalez and D. B. Johnson, Sorting numbers in linear expected time and optimal extra space, Information Processing Letters, 15(3):119–124, (Oct. 1982)

    Google Scholar 

  7. C. C. Handley, An in situ distributive sort, Information Processing Letters, 23(1986), 265–270

    Google Scholar 

  8. D. E. Knuth, The Art of Computer Programming, vol. III: Sorting and Searching, Addison-Wesley, Reading Mass. (1973)

    Google Scholar 

  9. T. W. Lai and D. Wood, Implicit selection, In proceedings SWAT 88, Halmstad, Sweden, Lecture Notes in Computer Science 318, 14–23, Springer Verlag, (Jul. 1988)

    Google Scholar 

  10. M. D. MacLaren, Internal Sorting by radix plus shifting, Journal of the ACM, 13(3):404–411, (July 1966)

    Google Scholar 

  11. W. W. Peterson, Addressing for random-access storage, IBM Journal on Research and Development, 1(4):130–146 (Apr. 1957)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institutionen för datateknik, Tekniska högskolan i Lule↕, S-951 87, Luleå, Sweden

    Svante Carlsson

  2. Datalogisk Institut, KØpenhavns Universitet, Universitetsparken 1, 2100, KØbenhavn O, Denmark

    Jyrki Katajainen

  3. Department of Computer Science, University of Turku, Lemminkäsenkatu 14 A, SF-20520, Turku, Finland

    Jukka Teuhola

Authors
  1. Svante Carlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jyrki Katajainen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jukka Teuhola
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Finkel Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlsson, S., Katajainen, J., Teuhola, J. (1992). In-place linear probing sort. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_214

Download citation

  • DOI: https://doi.org/10.1007/3-540-55210-3_214

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55210-9

  • Online ISBN: 978-3-540-46775-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation