Quicksort without a stack

  • Branislav Ďurian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 233)


The standard Quicksort algorithm requires a stack of size O(log2n) to sort a set of n elements. We introduce a simple nonrecursive version of Quicksort, which requires only a constant, O(1) additional space because the unsorted subsets are searched instead of stacking their boundaries as in the standard Quicksort. Our O(1)-space Quicksort is probably the most efficient of all the sorting algorithms which need a constant workspace only.


Algorithm O(1)-space Quicksort Searching Sorting Stack 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. E. Knuth: The Art of Computer Programming, Vol. III: Sorting and Searching. Addison-Wesley Reading, MA, 2nd ed. 1975.Google Scholar
  2. [2]
    R. Sedgewick: Implementing QUICKSORT Programs. Comm. ACM, Vol 21, No. 10, 1978, 847–856.Google Scholar
  3. [3]
    B. Ďurian: Quicksort without a stack: Design and analysis. Unpublished, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Branislav Ďurian
    • 1
  1. 1.VÚVT ŽilinaŽilinaCzechoslovakia

Personalised recommendations