Skip to main content
SpringerLink
Log in

Usort: An efficient hybrid of Distributive Partitioning Sorting

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

Abstract

A new hybrid of Distributive Partitioning Sorting is described and tested against Quicksort on uniformly distributed items. Pointer sort versions of both algorithms are also tested.

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. J. S. Kowalik and Y. B. Yoo,Implementing a distributive sort program, Journal of Information and Optimization Sciences 2, no. 1 (1981), 28–33.

    Google Scholar 

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

    Google Scholar 

  3. R. Loeser,Some performance tests of ‘Quicksort’ and descendents, CACM 17, no. 3 (1974), 143–152.

    Google Scholar 

  4. W. Dobosiewicz,Sorting by distributive partitioning, Info. Proc. Lett. 8, no. 4 (1979), 168–169.

    Google Scholar 

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

    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), 213–218.

    Google Scholar 

  7. D. C. S. Allison and M. T. Noga,Selection by distributive partitioning, Info. Proc. Lett. 11, no. 1 (1980), 7–8.

    Google Scholar 

  8. N. Wirth,Algorithms +Data Structures =Programs, Prentice-Hall (1976).

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

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

    Google Scholar 

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

  12. M. Huits and V. Kumar,The practical significance of distributive partitioning sort, Info. Proc. Lett. 8, no. 4 (1979), 168–169.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Virginia Polytechnic Institute and State University, 24061, Blacksburg, Virginia

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

Authors
  1. D. C. S. Allison
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. T. Noga
    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

Allison, D.C.S., Noga, M.T. Usort: An efficient hybrid of Distributive Partitioning Sorting. BIT 22, 135–139 (1982). https://doi.org/10.1007/BF01944472

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation