Leapfrogging samplesort

  • Eliezer A. Albacea

DOI: 10.1007/3-540-60688-2_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1023)
Cite this paper as:
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


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.


Samplesort Quicksort Leapfrogging Samplesort sorting analysis of algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Eliezer A. Albacea
    • 1
  1. 1.Institute of Computer ScienceUniversity of the Philippines Los BañosLagunaPhilippines

Personalised recommendations