Abstract
In this paper, we present a practical Quicksort-based sorting algorithm that exhibits the following properties: (1) O(n(log n) 2) worst case; (2) the expected number of comparisons is equal to the information-theoretic lower bound; and (3) the expected number of data interchanges is slightly higher than that of Quicksort. Considering the worst-case complexity, the average-case complexity and the simplicity of the algorithm, we claim that this algorithm is so far the most practical alternative to Quicksort. This is particularly true when one is not willing to take the risk of the worst case occuring when running Quicksort.
Preview
Unable to display preview. Download preview PDF.
References
Albacea, E.A., Leapfrogging samplesort and its improvements, ICS-UPLB Technical Report #95-2, Institute of Computer Science, University of the Philippines Los Baños, 1995.
Apers, P.M.G., Recursive samplesort, BIT 18 (1978), 125–132.
Davidson, C.M., Quicksort revisited, IEEE Transactions on Software Engineering 14(1988), 1480.
Frazer, W.D. and McKellar, A.C., Samplesort: A sampling approach to minimal storage tree sorting, J. ACM 17 (1970), 496–507.
Gonnet, G.H. and Baeza-Yates, R Handbook of Algorithms and Data Structures: In Pascal and C (2nd Ed) (Addison-Wesley, 1991).
Hoare, C.A.R., Partition: Algorithm 63; Quicksort: Algorithm 64; and Find: Algorithm 65, Communications of the ACM 4 (1961), 321–322.
Hoare, C.A.R., Quicksort, Computer Journal 5 (1962), 10–15.
Knuth, D.E., The Art of Computer Programming, Vol 3: Sorting and Searching (Addison-Wesley, Mass., 1973).
Peters, J.G., and Kritzinger, P.S., Implementation of samplesort: a minimal storage tree sort, BIT 15 (1975), 85–93.
Rohrich, A hybrid of Quicksort with O(n log n) worst-case complexity, Information Processing Letters 14 (1982).
Sedgewick, R., Quicksort (Garland, N.Y., 1978).
Sedgewick, R., Implementing Quicksort programs, Communications of the ACM 21 (1978), 847–857.
Wainwright, A class of sorting algorithms based on Quicksort, Communications of the ACM 28 (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albacea, E.A. (1995). Leapfrogging samplesort. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_30
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive