- Cite this article as:
- Apers, P.M.G. BIT (1978) 18: 125. doi:10.1007/BF01931688
- 44 Views
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.