Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. E. Knuth: The Art of Computer Programming, Vol. III: Sorting and Searching. Addison-Wesley Reading, MA, 2nd ed. 1975.
R. Sedgewick: Implementing QUICKSORT Programs. Comm. ACM, Vol 21, No. 10, 1978, 847–856.
B. Ďurian: Quicksort without a stack: Design and analysis. Unpublished, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ďurian, B. (1986). Quicksort without a stack. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016252
Download citation
DOI: https://doi.org/10.1007/BFb0016252
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive