BIT Numerical Mathematics

, Volume 18, Issue 2, pp 125–132

Recursive samplesort

Authors

  • Peter M. G. Apers
    • Information Science Dept.Vrije Universiteit Wisk Undig Seminarium
Article

DOI: 10.1007/BF01931688

Cite this article as:
Apers, P.M.G. BIT (1978) 18: 125. doi:10.1007/BF01931688

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.

Key words

internal sortingquicksortsamplesortminimalstorage sortingtreesort

Copyright information

© BIT Foundations 1978