Skip to main content
SpringerLink
Log in

Recursive samplesort

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A sorting algorithm called Recursive Samplesort is described and analyzed. An extensive average case analysis demonstrates that Recursive Samplesort is faster than both Samplesort and Quicksort, with respect to certain linear combinations of the number of comparisons and move instructions needed.

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. P. M. G. Apers,Recursive Samplesort, Technical Report IR 15 (1976), Vrije Universiteit, Amsterdam.

    Google Scholar 

  2. W. D. Frazer and A. C. McKellar,Samplesort: A Sampling Approach to Minimal Tree Sorting, J. ACM 17 (1970), 496–507.

    Article  Google Scholar 

  3. C. A. R. Hoare,Quicksort, Comp. J. 5 (1962), 10–15.

    Article  Google Scholar 

  4. J. G. Peters and P. S. Kritzinger,Implementation of Samplesort: a Minimal Storage Tree Sort, BIT 15 (1975), 85–93.

    Google Scholar 

  5. R. Sedgewick,Quicksort, PhD. Thesis STAN-CS-75-492 (1975), Stanford University.

Download references

Author information

Authors and Affiliations

  1. Information Science Dept., Vrije Universiteit Wisk Undig Seminarium, De Boelelaan 1081, Amsterdam, The Netherlands

    Peter M. G. Apers

Authors
  1. Peter M. G. Apers
    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

Apers, P.M.G. Recursive samplesort. BIT 18, 125–132 (1978). https://doi.org/10.1007/BF01931688

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation