Skip to main content
SpringerLink
Log in

Sorting in linear expected time

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A new sorting algorithm, Double Distributive Partitioning, is introduced and compared against Sedgewick's quicksort. It is shown that the Double Distributive Partitioning algorithm runs, for all practical purposes, inO(n) time for many distributions of keys. Furthermore, the combined number of comparisons, additions, and assignments required to sort by the new method on these distributions is always less than quicksort.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. A. R. Hoare,Quicksort (Algorithm 64), CACM 4, no. 7 (1961), p. 321.

    Google Scholar 

  2. R. Sedgewick,Implementing quicksort programs, CACM 21, no. 10 (1978), pp. 847–856.

    Google Scholar 

  3. W. Dobosiewicz,Sorting by distributive partitioning, Info. Proc. Lett. 7, no. 1 (1978), pp. 1–6.

    Article  Google Scholar 

  4. L. Devroye and T. Klincsek,Average time behavior of distributive sorting algorithms, Computing 26, no. 1 (1981), pp. 1–7.

    Google Scholar 

  5. M. T. Noga,Fast Geometric Algorithms, Ph.D. Thesis, Dept. of Comp. Sci., Virginia Polytechnic Institute and State University, Blacksburg, VA 24061 (1984).

    Google Scholar 

  6. H. Meijer and S. G. Akl,The design and analysis of a new hybrid sorting algorithm, Info. Proc. Lett. 10, no. 4–5 (1980), pp. 213–218.

    Article  Google Scholar 

  7. S. Baase,Computer Algorithms: Introduction to Design and Analysis, Addison-Wesley (1978).

  8. R. Loeser,Some performance tests of “quicksort” and descendants, CACM 17, no. 3 (1974), pp. 143–152.

    Google Scholar 

  9. M. van der Nat,A fast sorting algorithm, a hybrid of distributive and merge sorting, Info. Proc. Lett. 10, no. 3 (1980), pp. 163–167.

    Article  Google Scholar 

  10. J. S. Kowalik and Y. B. Yoo,Implementing a distributive sort program, Journal of Information and Optimization Sciences 2, no. 1 (1981), pp. 28–33.

    Google Scholar 

  11. R. C. Singleton,An efficient algorithm for sorting with minimal storage, CACM 12, no. 3 (1969), pp. 185–186.

    Google Scholar 

  12. G. W. Snedecor and W. G. Cochran,Statistical Methods, Iowa State Univ. Press (1967).

  13. D. C. S. Allison and M. T. Noga,Usort: an efficient hybrid of distributive partitioning sorting, BIT 22 (1982), pp. 135–139.

    Google Scholar 

  14. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).

  15. International Mathematical and Statistics Library, Edition 8, (1980).

Download references

Author information

Authors and Affiliations

  1. Lockheed Palo Alto Research Laboratory, 94304, Palo Alto, CA, USA

    M. T. Noga & D. C. S. Allison

  2. Department of Computer Science, Virginia Polytechnic Institute and State University, 24061, Blacksburg, VA, USA

    M. T. Noga & D. C. S. Allison

Authors
  1. M. T. Noga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. C. S. Allison
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Noga, M.T., Allison, D.C.S. Sorting in linear expected time. BIT 25, 451–465 (1985). https://doi.org/10.1007/BF01935365

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01935365

Keywords

Search

Navigation